Consider the following implementation of Kadane's algorithm: #include int max_num(int a, int b) if(a > b) return a; return b; int kadane_algo(int *arr, int len) int ans = 0, sum = 0, idx; for(idx =0; idx < len; idx++) sum = max_num(0,sum + arr[idx]); ans = max_num(sum,ans); return ans; int main() int arr[] = -2, -3, -3, -1, -2, -1, -5, -3,len = 8; int ans = kadane_algo(arr,len); printf("%d",ans); return 0; What changes should be made to the Kadane's algorithm so that it produces the right output even when all array elements are negative? Change 1 = Line 10: int sum = arr[0], ans = arr[0] Change 2 = Line 13: sum = max_num(arr[idx],sum+arr[idx])

Answer: Option C