You are given an array prices where prices[i] is the price of a given stock on the ith day.
Find the maximum profit you can achieve. You may complete at most two transactions.
Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).
1 <= prices.length <= 10^50 <= prices[i] <= 10^5prices = [3,3,5,0,0,3,1,4]6prices = [1,2,3,4,5]4prices = [7,6,4,3,1]0