Let A; represent the change in price of a stock on day i. Using the maximum subarray algorithm, state the values that are returned from the left partition, right partition, and cross-over, respectively, when A = [3,2, 5, 1, 4, 3]. 2. (3 marks) Calculate the expected number of iterations to find a pivot that guarantees at least 35% of the elements on each side of the partition.