Java. Please read carefully, as that there is a lot of information to make this easier for you.

The yellow boxes will be the actual work that needs to be done. The others are models.

public class CSC300Homework4 { * As a model for Problem 1, here are two functions to find the minimum value of an array of ints * an iterative version and a recursive version * precondition: list is not empty /** iterative version */ public static double minValueIterative (int[] list) { int result = list[0]; int i = 1; while (i 0) result = result + a[i]; i = i + 1; return result; public static int sumofPositivesRecursive (int[] a) { return -1; // TODO 1 replace this by a call to your helper function, then write the helper function below 1 this would be a good place to put the helper function for #1 * Here is an in-place iterative function to reverse an array. * in-place means: we don't create an extra array (to simplify coding) public static void reverseIterative (int[] a) { int hi = a. length - 1; int lo=@; while (lo