Given an array representing the price of a stock on each day, and an integer k, determine the maximum profit you can achieve by completing at most k buy-sell transactions (you must sell before buying again).