Let's define two functions(or methods in Java) prefixSum and suffixSum for an integer array of size n, Assume that the array indices starts with index 1 ( java has 0 based index)

-Function prefixSum(i) denotes the sum of first i numbers of the array

-Function suffixSum(i) denotes the sum of last n-i+1 numbers of the array

In this optimization problem, write pseudo code to find the minimum index i for which prefixSum(i) +suffixSum(i) become minimum

Hint you should pass A as a parameter and return the minimum index i.