During tough times like these, investment becomes more uncertain with more dangers. To solve it, we might try to train a model to decide when to buy or sell. Therefore, to provide it with correct...

By using divide and conquer algorithm:

1. write a code for the following example

2. Then, show it's Empirical analysis.

Extracted text: During tough times like these, investment becomes more uncertain with more dangers. To solve it, we might try to train a model to decide when to buy or sell. Therefore, to provide it with correct data, we plan to design an algorithm that answers: what is the perfect moment to buy and when to sell to maximize your profit? Assume you must buy Input: changes : array listing changes in the prices, where indices represent days; it has at least two values Output: i : index of the change before which we buy j: index of the change before which we sell maxProfit : the profit of this interval Example: Assume the below table contains the prices of a particular stock over days prices changes Day Value 50 1 63 13 70 7 3 40 -30 55 15 65 10 6 60 -5 7 72 12 8 79 7 9 68 -11 10 74 6 Therefore, the output of maxProfit([13,7,-30,15,10, -5,12,7, -11,6]) should be (3, 7, 39) . This is because our maximum profit would be 39 when we buy the stock at day 4, index of 3, and sell after day 8, index of 7. Then, the total profit is 15+ 10 – 5+ 12 +7 = 39 We will try to solve the problem using various techniques: Brute-Force Divide-and-Conquer