Best Time to Buy and Sell Stock atmost B times

Given an array of integers A of size N in which i^th element is the price of the stock on day i.

You can complete atmost B transactions.

Find the maximum profit you can achieve.

NOTE: You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

1 <= N <= 500

0 <= A[i] <= 10⁶

0 <= B <= 10⁹

The First argument given is the integer array A.

The Second argument is integer B.

Return the maximum profit you can achieve by doing atmost B transactions.

Input 1:

 A = [2, 4, 1]
 B = 2

Input 2:

 A = [3, 2, 6, 5, 0, 3]
 B = 2

Output 1:

 2

Output 2:

 7

Explanation 1:

 Buy on day 1 (price = 2) and sell on day 2 (price = 4), 
 Profit = 4 - 2 = 2

Explanation 2:

 Buy on day 2 (price = 2) and sell on day 3 (price = 6), profit = 6 - 2 = 4.
 Then buy on day 5 (price = 0) and sell on day 6 (price = 3), profit = 3 - 0 = 3.