Please use problem 3 to solve problem number 5 by coming up with a cleaner process for hygienic purposes

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. Suppose now that you are required to make the life of Dining Philosophers more hygienic. Because of advances in modern technologies, you can create instances of Cleaner processes. Each instance can cleanse one chopstick at a time. You can have any number of Cleaner processes, as you need. Using either the standard version of Dining Philosophers, i.e., where each philosopher can only access the two forks to his right and left, or the modified version of the Dining Philosophers problem described in Problem 3 or Problem 4, describe a hygienic version of the Dining Philosophers problem that uses the Cleaner processes, as described above. 5