Recall the Dining Philosophers Problem discussed in class. Develop a solution to this problem using AND Synchronization (aka Parallel Semaphores).

Your solution must work for n philosophers numbered 0 through n-1. Declare an array of semaphores to represent the fork resources. You may assume that each philosopher process knows its own id i. Each process also knows that it must pick up forks i and (i+1)%n to be able to eat.

Provide the implementation of a philosopher process i as a solution to this problem that is maximally concurrent and deadlock free.

Please use something similar to this example!!!!

Shared Variables: NW is a semaphore initialized to W, the total number of writers; NR is a semaphore initialized to R, the total number of readers; mx is a semaphore initialized to 1. Writer Reader loop loop SP(NW,1,1); SP(mx,1,1;NR,R,0); SP(NR,1,1; NW,W,0); Perform read; Perform write; SV(NR,1); SV(mx,1; NW,1); endloop; endloop