Although implementations vary, reader–writer locks usually block additional readers if a lock is already held in read mode and a thread is blocked trying to acquire the lock in write mode. This prevents a constant stream of readers from waiting writers.

The answer is "starving"

Explanation:

In the server, starvation occurs when a transaction is waiting for an infinite time to get a lock, which could not be done on many grounds, like as unequal priorities or any kind of resource leakage, etc.  

In the Database, it is not feasible. It also known as results from several actions, which reduce the population's access. It establishes the high mortality rates in a background of severe abuse over a significant time, and other choices were not correct because it can't be defined, in the given scenario.

False if not look it up online