Question $37$

Let $m[1],m[2],m[3],$dotsm$[n]$ be $n$ binary semaphores synchronizing $n$ processes. For the $i^{th}$ process, the critical section is executed as follows:

wait$($m$[$i$]$: wait$($m$($i$+1)\%($n$+1))-$Critical Section $..$ release$($mi$)$; release$($m$($i$+1)\%6($n$+1))$

Which of the following scenario$($s$)$ might occur?

Pick ONE OR MORE options

Deadlock

Starvation

None of the above