(1) Implement the minimum subsequence sum using divide-and-conquer by using Java or C++

(2) For the array =[4-3 5-2-1 2 6-2], you should provide the solution using the minimum subsequence sum. Test the sample for your code.

(3) Obtain the T(n) expression for the above algorithm