$($c$)$ Four processes arrive at a critical section in program code at the following times and CPU

bursts:

$J1$ arrives at time $1$ and has a cpu burst of $5ms.$

$J2$ arrives at time $2$ and has a cpu burst of $6ms.$

$J3$ arrives at time $3$ and has a cpu burst of $1ms.$

$J4$ arrives at time $5$ and has a cpu burst of $3ms.$

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$/$es

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

$(11$ marks$)$