in c languge please

13.28 Pointers - Ex4 General Description You are given an array that may contain both positive and negative integers. Your goal is to find the sum of any contiguous subarray of numbers which has the largest sum For example, if the given array is (6,-2,1,3,4,6,-2-6,-4-7), then the maximum subarray sum is 18 (see highlighted elements) Tasks .Read an integer from the user that represents how many elements you will allocate in memory as an array. You can store this in a variable called N 10 Create an array of N elements . Then you will read N integers from the user given to you in the following format and store them in the array. 6 -21 346-2 -6-4-7 Write a function call findBest that receives the array, the size of the array and returns the maximum subarray sum " print out the return value from your function using the format %d Do this by calling your function n the main function Example 1: When the input is 10 6 -2 1 346-2-6-4-7 The output is: 18 Example 2 When the input is 266-27-3 -6-3- The output is 17 LAB ACTIVITY 13.28.1: Pointers Ex4 5/13 main.c Load default template