3 points) Consider the following "a" Integer array and the alternatives for the "partialSum" method. public static void main(String[] args) { Nint[] a = {1, 4, 1, 3); int[] result = partialSum(a); System.out.println(Arrays.toString(result)); } What we want for the "partidum" method to do is return an integer array ("sum") back which is generated such that for all i values sumt! will be equal to myArr[+myar U myrr[2]- _-mynd For example if myArt is 41,2,3,4) sum[O)-myArr[0]=1 sum[1]-myArr[0]=myArr[1] - 3 sum[2]=myAr[0]-myArr[1] - myArt2) - 6 sum[3]=myArtOj+myArt-myArr(21-myart 3] - 10 Which of the following statement is true about the proposed alternative implementations of partialum" method? Alternative 1 public static partially - Arr.length tot tiength Alternative 2 public static in partit intilu in lengti for at wr.leng) for it ATHINE returs return Alternative 1 Alternative 2 public static int'l partiatsum(intl) myArr) { int[sun = new int[myArr. length); for (int j = 1