Write pseudocode for the brute-force method of solving the maximum-subarray problem. Your procedure should run in $\Theta(n^2)$ time.

Pseudo-code for FIND-MAXIMUM-SUBARRAY-BF(A, low, high):