reader$()\{$ P$($mutex$)$ reading$++$ if$($reading $==1)$ P$($w$)$ V$($mutex$)$ READ P$($mutex$)$ reading$--$ if$($reading $==0)$ V$($w$)$ V$($mutex$)\}$

writer$()\{$ P$($w$)$ WRITE V$($w$)\}$

Initially: mutex $=$ w $=1$; reading $=0$

$($a$)$

Does the solution satisfy the basic requirements of the readers$/$writers problem? Is starvation of readers or writers possible?