nore Libraries 139.76% C Solution to dinning-philosopher problem is given below. Although this solution guarantees that no two neighbours are eating simultaneously, it nevertheless must be rejected because it could create deadlock. Suppose that all five philosophers become hungry at the same time and each grabs her right chopstick. All the elements of chopstick will now be equal to 0. When each philosopher tries to grab her left chopstick, she will be delayed forever. Several possible remedies to the deadlock problem are replaced by: 1. Allow at most four philosophers to be sitting simultaneously at the table. 2. Allow a philosopher keo pick up her chopsticks only if both chopsticks are available (to do this, she must pick them up in a critical section). . Dinning-philosopher basih solution wait (chopstick[i]); wait (chopstick[ (i+1) % 5]); /* eat for a while */ signal (chopstick[i]); signal (chopstick[(i+1) % 5]); /* think for a while */ /