c$)$ Use brute$-$force method $($Theta n square$)$:

Use brute$-$force method to write program to solve maximum subarray

problem. $1.$Input at least $58$ or more sets of randomized unsorted data with N elements in each set. For example, N$=15,20,25,30,40,4549.$ Your array elements must be of real numbers.

$2.$ Display the original array and the maximum sub$-$array beginning and ending interval and the sum for each maximum sub$-$array.

b$)$ Draw graphs by using counter in the program to compare the actual counting of the algorithm time complexity and the theoretical time complexity.