Create the recursive solution to the following using tail recursion: /******************************************************************************************************************** For max() you are to create the code that returns the index of the the largest number found in the given array (nums) Example: max("school") would return: false *******/ public int max(int[] nums) { return -1; *** *********** ******* { Paste your answer in the box provided and change the format to "Preformatted" and ensure it is formatted well