Operating Systems Concepts, 9th Edition (International edition), answer the following questions:
Consider a system consisting of three resources of the same type that are shared by three processes, each of which needs at most two resources. Show that the system is deadlock or deadlock-free.
Consider a system consisting of six resources of the same type that are shared by four processes, each of which needs at most two resources.
Show that the system is deadlock or deadlock-free. Consider the version of the dining-philosophers problem in which the chopsticks are placed at the center of the table and any two of them can be used by a philosopher.
Assume that requests for chopsticks are made one at a time.
Describe a simple rule for determining whether a particular request can be satisfied without causing deadlock given the current allocation of chopsticks to philosophers.