The dining philosophers problem is one of the classic examples of a synchronization and, ultimately, a deadlock problem. Five philosophers sitting around a table are alternately thinking or eating. In front of each philosopher is a plate filled with food; between each plate is a chopstick. To be able to eat, a philosopher must have two chopsticks. Each has taken a vow of silence and therefore can never speak to one another. The result: possible deadlock.

(a) Model the problem and resources using a resource allocation graph. Does the graph contain a potential cycle? If it does, show such a case.

(b) Based on the conditions necessary for deadlock, why is there the possibility for deadlock? Explain.

(c) Propose a solution to the problem / rule(s), so that the deadlock is avoided. Explain why your solution/rule works.