1: Write a java program that can compute sum of an array using recursive calls (1 point) Test the program uses the array of {4,3,6,2,5,10}

2: Using throws statement to handle run-time error to write a java program that uses two recursive power function objects we addressed in class. Compare the execution time (in nanoseconds) of the result. (1 point)

3: The odd/even factorial of a positive integer is represented as n!! and is defined non-recursively as: (n)(n-2)(n-4)(4)(2) if n is even and is (n)(n-2)(n-4)(5)(3)(1) if n is odd. For example 7!! Equals 7*5*3*1 or 105 and 6!! Is 6*4*2 or 48. Write a method called oddevenfact that recursively calculates the odd/even factorial value of its single int parameter. The value returned by this method may be a long data type.