Write a method that returns the "funny product" of two positive integers with the same number of digits. As a precondition you may assume that num1 and num2 have the same number of digits. The "funny product" is the sum of the products of the digits in the same place-value in each number. For example, the "funny product" of 541 and 372 is 45 because 5*3+4*7+1*2 is 45. This problem may be solved with or without recursion! Look at the test data for further examples.