Given an array of numbers, find 2 indexes of the smallest array element (the pivot) on both right and left sides, for which the sums of all elements to the left and to the right are equal. The array may not be reordered. Complete the function balancedSum in the editor below. balancedSum has the following parameter(s): int arr[n]: an array of integers Returns: string: 2 integers representing the indexes of the pivot on both sides
