PROBLEM 3 (25 POINTS) The Running Sums problem is defined as follows: Input: a sequence (a1, ..., An), where each a; is either 1 or -1. Desired output: a sequence (b1, ...,bn), where each b; is either o or 1. Your goal is to minimize 21 0, for all je {1,2, ...,n} . 1