This project implements a solution to the Dining Philosophers Problem using Pthreads mutex locks and condition variables in the Chapter 5 Programming Project 2, pp 252-253. An asymmetric solution is used to avoid deadlock. Description The main function will create PHILOSOPHER_NUM (5) threads for philosophers and will sleep for a period of time (run_time), and upon awakening, will terminate all threads and print out the numbers of meals each philosopher eats. A philosopher thread exits when the MAX MEALS (10) meals have been completed. Use sleep function for random one to MAX_THINK_EAT_SEC (3) seconds thinking and eating time. The main function will be passed one parameter cuatire on the command line. The program may be named danangvpnadg G