Please use question 3 to answer question 4. Use resource allocation graph and show all work please

3. Consider a version of the Dining Philosophers problem in which the chopsticks are placed at the center of the table and any philosopher can use any two of these chopsticks. Assume that the 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 the philosophers. Consider a modified version of the above Dining Philosophers Problem in which each philosopher would require three chopsticks to eat. Can you utilize the Resource Allocation Graph method to determine whether a particular request can be satisfied without causing deadlock in the system? If so, why? If not, why not? 4