Write a method that find the "funny sum" of the numbers in an array of exactly three positive integers. To find the "funny sum", you must first find the two largest numbers in the array. Add those two numbers together and replace the smallest number in the array with that sum. Repeat this process 'iteration' number of times and return the running total sum of all the pairs of numbers you added. For example, with the input array {7,2,5} and iterations=2, you would first add 7+5 to get 12. Keep 12 in your running total. Also replace the 2 (lowest number) with 12. Now add to your running total the result you get by finding the "funny sum" of {7,12,5} with iterations=1. So you add 7+12 to get 19. Add that to the 12 from before to get 31. Now find the "funny sum" of {7,12,19} with iterations=0. Since iterations=0, the "funny sum" is zero. Add zero to your running total which gives 31, which is the answer!