Can anyone help?

Maximum subarray problem is to find a contiguous subarray with the largest sum, given an array of numbers. Given N numbers from array All..N] with indices 1 sisis N, the sum Alk] is the largest possible. For example, given the array of values [-2, 1,-3, 4,-1, 2, 1,-5,4 ], the contiguous subarray with the largest sum is [4,-1, 2, 1] with sum 6 Design algorithms to sove the problem with pseduocode, Java programs, and algorithmic analysis (a) Design a brute force algorithm (b) Design an algorithm with improved performance ( order-of-growth ) than (a) (c) Write up both algorithms as pseudocode, and include each as comment blocks in its Java implementation. (d) Repeat experiments at least 10 times on both (a) and (b), with input size doubled each time (e) Generate plots from the experiments, and provide your algorithmic analysis in a one page document w diagrams, use StdDraw class, from the booksite, to produce plots of the experimental data. To dra Several sample usages can be observed from t from the booksite at http://algs4.cs.princeton.edu/home/. You can find all API documents for all the classes from the book at http://algs4.cs.princeton.edu/code/javadoc/ he examples on page 45. More API usages can be found