Question $1$: Dynamic Programming in Data Science$$

Problem Statement:

You are given a dataset representing daily stock prices for a company over n days in an array prices$[].$ Your task is to write a Python function to calculate the maximum profit you can achieve by performing at most two buy$-$sell transactions. The second transaction must start only after the first is completed.

Requirements:

Implement a dynamic programming solution.

Provide an explanation of the time complexity of your algorithm.