Using C Language using pthreads and semaphores.

Using the following rules of the Dining philosophers problem:

N philosophers spend their lives thinking and eating rice.

There are only N chopstick on the table, one between every two philosophers.

In order to eat, a philosopher needs to get hold of the two chopsticks that are closest to her.

A philosopher cannot pick up a chopstick that is already taken by a neighbor.

Implement the dining philosophers problem using pthreads and semaphores.

Your program should print the philosopher that is eating, the chopsticks that is using and when the philosopher finished eating.

A correct implementation will run like this:

./diningPhilo Philosopher 0 is eating using:0,1 Philosopher 2 is eating using:2,3 Philosopher 4 is eating using:4,5 Philosopher 8 is eating using:8,9 Philosopher 6 is eating using:6,7 Philosopher 0 finished eating Philosopher 6 finished eating Philosopher 6 is eating using:6,7 Philosopher 2 finished eating