Write the following pseudocode in C running code. for the Array use an array that is of size 16 numbers. use a mix of positive and negative numbers.

With a linear-time FIND-MAX-CROSSING-SUBARRAY procedure in hand, we can write pseudocode for a divide-and-conquer algorithm to solve the maximum- subarray problem FIND-MAXIMUM-SUBARRAY (A, low, high) 1 if high-low 2 return (low, high, A[low]) 3 else mid - \(low +high)/2] 4(left-low, left-high, left-sum) - base case: only one element FIND-MAXIMUM-SUBARRAY (A, low, mid) (right-low.right-high, right-sun) - FIND-MAXIMUM-SUBARRAY (A, mid 1,high) (cross-low, cross-high, cross-sum) - FIND-MAX-CROSSING-SUBARRAY (A, low, mid, high) 7 f left-sum right-sum and left-sum cross-swn return (left-low, left-high, left-swn) 9elseif right-sum left-sum and right-sumcross-sum 10 return (right-low, right-high, right-sum) else return (cross-low, cross-high, cross-sum)