PLEASE SHOW A SNIP/PICTURE OF YOUR OUTPUT.

Write a c program to implement Kadane's linear algorithm used to solve the maximum-subarray problem for arrays of length 16, as summarized in exercise 4.1-5 on p. 75. Use as inputs the array given on p. 70 and at least two more of your own making.

This is page 75 summary:

This is the array from page 70:

Use the following ideas to develop a nonrecursive, linear-time algorithm for the maximum-subarray problem. Start at the left end of the array, and progress toward the right, keeping track of the maximum subarray seen so far. Knowing a maximum subarray of AIJ], extend the answer to find a maximum subarray ending at in- dex j + l by using the following observation: a maximum subarray of A[1j + j is either a maximum subarray of All . . or a subarray Ali . J + 1], for some lsisj +1. Determine a maximum subarray of the form Ali..j in constant time based on knowing a maximum subarray ending at index j