Implement a solutionin detailed pseudo code--that is better than the brute force solution. Your pseudo code should be detailed enough that others can walk through it with test cases. Do a run through with test cases you think are representative of the problem to show your code works; what is the time complexity, space complexity? How did you come up with those complexities? Maximum-subarray. Use the following ideas to develop a nonrecursive, linear-time algorithm for the maximum-subarray problem. Start at the left end of the array, and progress toward the right, keeping track of the maximum subarray seen so far. Knowing a maximum subarray of A[i..j], extend the answer to find a maximum subarray ending at index j+1 by using the following observation: a maximum subarray of A[1..j+1] is either a maximum subarray of A[i..j] or a subarray A[i..j+1], for some 1<= i <= j C1. Determine a maximum subarray of the form A[i..j+1] in constant time based on knowing a maximum subarray ending at index j .