Q$12[4$pts$]$ Assume that processes P$1,$ P$2,$ P$3,$ P$4,$ and P$5$ arrive at the system at the same time in that

order and $P1$ is scheduled to run. The rest are in ready state waiting for the CPU. Assume that First Come

First Served scheduling is used and there are three semaphores S$1,$ S$2,$ and S$3.$ Initial values of all the

semapores are $0.$

$($a$)[2$pts$]$ What will be the values of S$1$ and S$2$ after the following sequence of actions

P$1$ does down$($S$1)$

$P2$ is scheduled and does down$($S$2)$

$,P3$ is schedule and does up$($S$1)$

P$4$ is scheduled and does up$($S$1)$ followed by a down$($S$2)$

$($a$)[2$pts$]$ What would be the content of the blocked queue after the actions listed in $($a$)?$