Please provide an solution for the below :

1a) Consider the incorrect solution below to the Dining Philosophers problem below. There are 5 philosophers. Philosopher i where (i = 0, 1, 2, 3, 4). There are five (5) semaphores fork(i) which are all initialized to

1. Show a sequence of events where deadlock can occur.

while (true){

think;

wait(mutex);

wait fork[i];

signal(mutex);

wait(mutex);

wait fork[(i+1) %5];

signal(mutex);

eat;

signal(fork[i]);

signal(fork[(i + 1) %5];

}

1b) How would you fix the code above so that deadlock does not occur?