Consider the Statecharts for a solution to the two$-$task mutual exclusion problem

in Figures $5\mathrm{.}3$ and $5\mathrm{.}4.$ Statechart A is basically a classical finite$-$state machine

whereas Statechart B takes advantage of Statecharts$$ features. Show the two corresponding Statecharts for a system with three tasks. Describe how Statechart B

$($for both the two$-$task and three$-$task systems$)$ avoids the state$-$explosion problem

found in Statechart A