Question $2$: Semaphores $(20$ points$)$

$($This question is related to ILO $2$c $-$ "explain the underlying causes of concurrency and deadlock issues".$)$

Consider using a binary semaphore to implement a solution to the Dining Philosophers. The following is the $($C$-$like$)$ code segment that implements the philosopher's behavior:

$//$ N is the number of philosophers and forks

$//$ function Left$($X$)$ returns the id of the philosopher X$\text{'}$s left fork

$//$ function Right $\backslash (($X$)\backslash )$ returns the id of the philosopher $\backslash ($ X $\backslash )\text{'}$s right fork

BinSema sem;

sem$\_$init$(\backslash$&sem, $1)$;

BinSema fork$[$N$]$;

for $($int i$=0$; i