3. Coding Question: For the index position in an array where the sum of elements at lower indexes is equal to the sum of elements at higher indexes. Write a function int balanced(int[] arr); that given a sequence arr[] of size n, returns the index (if any) or -1 if no index position is found. a. Include comments within your code. Be detailed. b. What other approaches did you consider to solve this question and why did you choose this approach? c. List any assumptions. Examples Input: A[] = [-8, 2, 6, 2, -5, 4, 1] Output: 3 3 is an index that works, because: A[0] + A[1] + A[2] = A[4] + A[5] + A[6] Input: A[] = {2, 4, 6} Output: -1 because no appropriate index exists Index 3 Sum: 6 Sum: 6 Input: [4, -3, 5, 1, 2, 5, -1] Output: 3 Microsoft CYBORGMOBILE Index 1 Sum: 16 Sum: 16 Input: [16, 8, 2, 4, 4, 6] Output. 1 Index 5 Sum:7 Sum: 7 Input: [2, 4, 4, 0, -3, 3, 1, 6] Output: 5 Input: [2, 3, 5, 5, 2] Output: -1 Input: [2, -1, 1] Output. 5