2-2 Write a function that given an array of integers, determines the maximum sum of any possible contiguous sub-array. If all the numbers are negative the result is 0 signature: int "ninn-sun(int *nuns, int length) ; For example, for the array: 31, -41, 59, 26, -53, 58, 97, -93, -23, 84) the sub-array with the largest sum is: 59, 26, 53, 58,97 1 The result would be: 187