Suppose you have the following array: int arr[] = {2, 3, 4, 5, 7} Trace the given code in the picture using the given array to answer the following :- a. What is the time complexity of the given code? b. Show the first three steps of your tracing. c. Implement the algorithm using C++ or Java. Run the code for the given array.

FIND-MAXIMUM-SUBARRAY CA, low, high) 1 if high low 2 return (low, high, Allow ll base case: only one element 3 else mid L(low high)/2J 4 left-low, left-high, left-sum) FIND-MAXIMUM-SUBARRAY (A, low, mid) 5 (right-low, right-high, right-sum) FIND-MAXIMUM-SUBARRAY (A,mid 1, high) 6 cross-low, cross-high, cross-sum J FIND-MAx-CROSSING-SUBARRAY (A, low, mid, high) 7 if left-summ right-sum and left-sum z cross-suma return (left-low, left-high, left-sum) 9 elself right-sum 2 left-surm and right-sum z cross-sum 10 return (right-low, right-high, right-sum) 11 else return (cross-low, cross-high, cross-sum)