semaphore fork5]1 semaphore s 1 void philosopher(int i) while(true){ think wait (s); wait(forki]) wait (forkli 1 mod 5); signal(s); eat wait (s); signal(for ); signal(fork[i + 1] mod 5); signal(s); (a) Explain what semaphores are and the effect of the wait and signal operations (6 marks) (6 marks) (4 marks) (4 marks) Describe how semaphores can be used for concurrent programming (b) Explain whether this code avoids deadlock. c) Explain whether this code avoids starvation. (d Modify the code so that it provides a satisfactory solution. Justify your