Consider an application that initially consists of three sequential tasks $($Task $1,$

Task $2,$ and Task $3),$ where each task depends on the results of the previous task. Assume each

task consists of a single CPU burst without Input$-$Output $($IO$)$ operation, requiring $70$ms$,240$ms$,$

and $50$ms respectively. In order to improve the performance of the application, the developer

decides to re$-$write Task $2$ of the application to take advantage of multiple processor cores.

Compute the maximum theoretical speedup to the overall application, assuming it will run on

a machine with two processor cores.