$($c$)$ Three processes $J1,J2$&$J3$ arrive at a critical section in program code at times $1,2$ and $3$

respectively. $J1,J2$ and $J3$ need to spend $8ms,3ms$ and $2ms$ respectively in the critical section.

The critical section is protected by a semaphore $S$ that can allow up to $2$ users at the critical

section simultaneously. Trace events occur while all processes pass through the critical section.

Complete the timetable below showing when processes will call $P(s)$ or $V(s),$ which process is

in the critical section, which process$/$es are blocked in the $Q$ and the value of $S$ each time.

$1,$mark per correctly filled row. X $1=10$ marks.