All problems solve with Recursion in java

This lab will enrich your understanding of the Recursion we use in this course. Solve the following problems: 1) Given an array of N integers called A, and the integer function max(x, y); that takes the two integers x and y as its input and returns the maximum of the two. Write a recursive java integer function called, arrayMax(A[], N), to compute the maximum of the Nintegers in array A by using the function max(x,y). 2) Give a recursive algorithm to compute the product of two positive integers m and n using addition and subtraction 3) Write a recursive algorithm to compute the sum of digits of a number using recursion. 4) Write a short recursive Java method that takes a character strings and outputs its reverse. For example, the reverse of pots&pans' would be 'snap&stop