2. Solve the following problem by writing the pseudocode, and then trace through the pseudocode on some sample input (to see that the code does work, at least on the sample input) // Input: a[1...n]: certain company's stock price for n consecitive days Il output: the largest one-day increase during these n days, // i.e., max (a[i]-a[i-1]) for any i=2, ...n) FindLargestOneDayIncrease (a[1...n] 3. Write pseudocode to reverse a list 4*. Given same input as problem 2, what if we want to find the largest increase during the n days? For example, if a[1...6] = {10, 2, 20, 30, 1, 12} The largest increase during these 6 days would be a[4]-a[2] = 30-2 =28. This means, if one is to buy and then sell the stock with these 6 days, then buying on day 2, and selling on day 4 will result the biggest return