Please help, will give thumbs up. Please do not copy from other chegg questions. Thank you

Question 2 [Points 6] Consider the version of the dining-philosophers problem in which the chopsticks are placed at the center of the table and any four of them can be used by a philosopher. In other words, a philosopher needs four chopsticks to eat. Assume that requests for chopsticks are made one at a time. Assuming that there are m=4k chopsticks and n=6k philosophers around the table, (i) How many maximum philosophers can eat simultaneously? (ii) Describe a simple rule for determining whether a particular request can be satisfied without causing deadlock given the current allocation of chopsticks to philosophers. (Hint: Use rules similar to the Banker's algorithm.)