Problem:

The Dining Philosopher Problem states that $K$ philosophers seated around a circular table with one chopstick between each pair of philosophers. A philosopher may eat if he can pick up the two chopsticks adjacent to him. One chopstick may be picked up by any one of its adjacent followers but not both. There are three states of the philosopher: THINKING, HUNGRY, and EATING.

Implementation Requirement:

In this programming assignment, you will simulate each philosopher with an independent thread. Your goal is to write a system that allows each philosopher to eat $-$ nobody is permitted to "starve."

Your results should contain a sample run that shows the action of each philosopher at the table. Each philosopher$/$thread must announce when it has picked up a fork $($and which one: right or left$),$ when he it has "eaten," and when it has put down a fork. If any other "interesting" activities are taking place, the philosopher may also announce additional behavior. Your run should be long enough to demonstrate that each philosopher has had the opportunity to eat at least twice, and that dining privileges have been distributed equitably.

Provide:

The code that you developed for your experiment.

Evaluation Criteria:

Code functionality and correctness

Proper handling of boundary conditions

Clear output demonstrating requirements are met

Quality of implementation