I need help with this, Is there anyone that could provide me with the code in either C or C++ with an explanation on how it works (commenting through the code works the best for me because I retain it better). Thank you so much!

Solve the Dining Philosopher Problem using message passing The dining philosopher problem is stated as follows: Five philosophers sit around a table. Each philosopher alternates between thinking and eating. In front of each philosopher there is a rice bowl. When a philosopher wishes to eat, he picks up two chopsticks next to his plate. There are, however, only five chopsticks on the table. So a philosopher can eat only when neither of his neighbors is eating. Develop a deadlock-free solution for this problem. Develop a program using C or C++ on UNIX system which will create five philosopher processes using the UNIX fork system call. These process will think, become hungry, eat until full, begin thinking again, etc. Each process will request the use of its chopsticks via a UNIX pipe system call. Show the state of all philosopher for 100 state changes. Gather and print statics for 10,000 state changes. Psudo code:

Main ()

{