Consider the Dining-Philosophers problem (Chapter 5.7.3), in which a set of philosophers sit around a table with one chopstick between each of them. Let the philosophers be numbered from 0 to n1 and be represented by separate threads. Each philosopher executes Dine(i), where i is the philosophers number. Assume that there is an array of semaphores, Chop[i] that represents the chopstick to the left of philosopher i. These semaphores are initialized to 1.

void Dine( int i )

{

Chop[ i ] .P(); / Grab left chopstick /

Chop[( i+1)%n ] .P(); / Grab right chopstick /

EatAsMuchAsYouCan ();

Chop[ i ] .V(); / Release left chopstick /

Chop[( i+1)%n ] .V(); / Release right chopstick /

}

This solution can deadlock. Assume that it does. List the four conditions of deadlock and explain why each of them is satised during the deadlock.