Using recursion method

$($

Theta n lg n

$)$

:

Using Maximum contiguous sub

$-$

array algorithm Implement a Program in Python

to find a maximum sub

$-$

array in a given array of size N

$,$

$1$

$.$

$$Input at least

$5$

$$

$8$

$$or more sets of randomized unsorted data with N elements in

each set. For example, N

$=$

$1$

$5$

$,$

$2$

$0$

$,$

$2$

$5$

$,$

$3$

$0$

$,$

$4$

$0$

$,$

$4$

$5$

$4$

$9$

$.$

$$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.