Interprocess communication in a distributed system 1 - open to bidding

It is a distributed version of the Dining Philosophers problem. Attached is a file with specific directions. Notice that you will have a server that creates 10 child processes using fork(). The ten children processes will represent 5 philosophers and 5 forks. TCP/IP connections between each philosopher and the two adjacent forks will determine when the philosopher can obtain a fork. The program will have to provide for a means for releasing resources if deadlock results. The programming should be done in C.