Suppose that for some index (a) k of interest, you want to optimize the aggregate growth under the constraint that you own the card on day k and sell it strictly after day k (i.e., you purchase it at the start of some day i k and sell it at the end of some day j > k). Give an algorithm that solves this problem in O(n) time. On input A[1, . . . , n] and k, it should output the maximum aggregate growth, and corresponding purchase and sale days i, j that achieve it