What is$/$are true about the solution to the first readers$-$writers problem?$($c$)$ No process will be starved $($d$)$ Both readers and writers can be starved $($b$)$ Only writers can be starved $($a$)$ Only readers can be starved