Dining Philosophers Individual Assignment We discussed the 'Dining Philosophers' problem. In my version, N philosophers and N Sporks are placed evenly around a circular table. (Some versions have N philosophers and N single chopsticks. Same principle.) Initially a philosopher's strategy might be: Grab Spork on the left. Grab Spork on the right. Eat until full. Lick Spork in right hand clean, then put it back down. Lick Spork in left hand clean, then put it back down. Initially the headwaiter's strategy might be: If no one is eating, sedate someone who is not eating at random, placing any Spork they have back on their left or right. 1) 2) 3) 4) Come up with a better strategy for the hungry philosophers, if possible. Come up with a better strategy for the headwaiter, if possible. Can your strategies guarantee there will be no problem? Can your strategies be used for operating systems and processes? Write up your approach. It is not necessary to have formal pseudocode