Write a method that returns the "Ebbert" of a positive integer. The "Ebbert" of a positive integer is found by treating the ones place as a base, and each successively higher place value (10's place, 100's place, etc.) as a power. For example, the "Ebbert" of 432 would be found by (2^3)^4 which equals 4096. Since these numbers can get very big very fast, return your answer as a double. You may use Math.pow to help you if you want to, but it is not required. You may use recursion, but it is not required. As a precondition you may assume that the test data will not be so large that it causes round off error in the result.