Statement A is correct.
In the standard reader-preference solution, the first reader executes:
$\texttt{wait(wrt)}$
This prevents a writer from entering while readers are active.
Statement B is correct.
The last reader executes:
$\texttt{signal(wrt)}$
This allows a waiting writer to access the shared data.
Statement C is correct.
If readers continue arriving, the number of active readers may never become zero.
As a result, a waiting writer may remain blocked indefinitely. This is writer starvation.
Statement D is incorrect.
If all five philosophers acquire their left chopsticks first, each philosopher may hold one chopstick and wait for the other.
This creates circular waiting and may cause deadlock.
