This question is about the Readers/Writers Problem. Using semaphores, the problem is solved as follows: Writer readers wait(wrt); write(); signal(wrt); wait (mutex); if (++readers == 1) wait (wrt); signal (mutex); read(); wait (mutex); if (--readers == 0) signal(wrt); signal (mutex); Question 24 5 pts (a) Is this solution prone to starvation? If YES, explain who gets starved and how. If NO, explain why. Question 25 5 pts (b) if your answer to (a) is YES, suggest and explain a starvation-free solution