The application developer parallelises Task $2$ by splitting it into three independent

sub$-$tasks $($Task $2$a$,$ Task $2$b$,$ Task $2$c$),$ each executing as a CPU burst of $80$ms with no IO$.$ Initially,

this parallelised version is tested on a machine with a single processor core. Assume that task $1$

arrives at time $0$; tasks $2$a$,2$b$,$ and $2$c all arrive $($in that order$)$ immediately after task $1$ has

completed; and task $3$ arrives after all other tasks have completed. Draw a Gantt chart showing

the scheduling order of the whole application assuming that the operating system uses

round$-$robin scheduling with a $50$ms time quantum and that context switching time can be

ignored.