Given an array of integers, find the maximum sum of any contiguous subarray. Example: Input: [-2,

Please code in C.

Define the following function that takes an array of integers to fill it with randomly created integers between the given range. The second argument of the function is the size of the array, "first" is the first value for random integers and "nums" is the number of terms in the given range. (i.e., when first is 10 and nums 35, the range will be between [10-44]) The function also returns the minimum value in this array. int myRandArr(int arr[], int size, int first, int nums); Write the main function to create an array and test your function. For this purpose, create and integer array between the range [-15-15] and display values together with the minimum value. Sample Output: Elements of randomly created array: 4 13 -11 -12 -2 The min of those values: -12

write in html and script