In C code!

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 subarray of numbers which has the largest sum. any contiquous For example, if the given aray s (6,-2,1,3,46 2,64-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 alocate in memory as an array You can store this in a variable called N . 10 Create an array of N elements you will read N integers from the user given to you in the following format and store them in the array Then 6-21346-2 -6 -4 -7 Write a function call findBest that receives the array, the size of the array and retuns the maximum subarray sum Print out the return value from your function using the format "d. Do this by calling your function Example 1: When the input is 6-213 46-2-6-4-7 The output is Example 2 When the input is 266-27-36-3- The output is LAB ACTIVITY 1328.1 Ponters- Ex4 5/13 Load default template. 1 sinclude estdio.h 2#include