Implement the Dining Philosophers problem [in C] by creating 5 threads and using mutex for synchronization.

However, care must be taken to prevent a deadlock problem. One possible solution to alleviate the deadlock is known as an asymmetric solution, that is, an odd philosopher picks up first a left chopstick and then the right one, while an even philosopher picks up first a right chopstick and then the left one.

Write your C program using pthread_create for each dinning philosopher. Your program should take two arguments; a number of time to eat and a number of philosophers eatings from the command line.

Program should look like:

% dphil 10 7 // each philosopher will eat 10 times before existing. There are 7 philosophers.

Philosopher 0 is thinking...

Philosopher 1 is eating...

Philosopher 3 is thinking...

Philosopher 4 is thinking...