I need help with this java lab:

You will need to complete two recursive methods for this lab assignment.

• Write a recursive method to sum the values in an integer array (the sumOfArray() in the provided ArraySumDriver.java file)
  • In addition, make it to be a generic method
  • Be sure to talk about it in your write-up
• Implement an additional recursive method to compute a Fibonacci number using the dynamic programming version.
  • You MUST implement the dynamic programming version in order to earn credit for this

public class ArraySumDriver { private final static int ARRAY_SIZE = 6;

/** * @param args */ public static void main(String[] args) { int index = 0;

Integer[] myArray = new Integer[ARRAY_SIZE]; myArray[index++] = 13; myArray[index++] = 5; myArray[index++] = 12; myArray[index++] = 6; int sum = sumOfArray(myArray, 3); System.out.println(sum); myArray[index++] = 7; myArray[index++] = 1; sum = sumOfArray(myArray, 5); System.out.println(sum); } /** * Recursive method for generating sum of values in array * @param arr array of Integers * @param num index of array to sum all previous index values (including num) * @return sum of array values */ public static int sumOfArray(Integer[] arr, int num) { // Implement your code here return -999; // PLACE HOLDER }

}

Thank you for your help, I will rate it.