In Java

Maximum Subarray Sum: Implement each of the following algorithms to return the maximum subarray sum as well as the indices of the first and last elements in the maximal array. Then write code to test each of the algorithms.

(a) Brute algorithm that runs in O(n2).

(b) Divide and conquer algorithm that runs in O(nlgn)

(c) Kadane's algorithm that runs in O(n). Note that you will need modify the pseudocode of this algorithm to return the indices of the first and last element in the subarray.