Question $3$: Consider the following complex binary semaphore$-$based solution for a three$-$process

synchronization problem. Processes P$0,$ P$1,$ and P$2$ try to access a shared critical section:

binary$\_$semaphore S$0=1$;

binary$\_$semaphore S$1=0$;

binary$\_$semaphore S$2=0$;

Process $0$:

wait$($S$0)$;

$//$ critical section

signal$($S$1)$;

Process $1$:

wait$($S$1)$;

$//$ critical section

signal$($S$2)$;

Process $2$:

wait$($S$2)$;

$//$ critical section

signal$($S$0)$;

$1.$ Verify if the above solution ensures Mutual Exclusion, Progress, and Bounded Waiting for the

critical section.

$2.$ If any of the synchronization requirements are not satisfied, propose a modification to address the

issue and explain why the modification works.