2. Write up pseudocode for the divide-and-conquer soltuion to the following problem as studied in class. And trace through your code using the given input. 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. 2. Write up pseudocode for the divide-and-conquer soltuion to the following problem as studied in class. And trace through your code using the given input. 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