Please provide a detailed answer for the following question:

Consider the dining philosopher problem with 10 philosophers. Assume that philosopher i (i = 0, 1,..., 9) executes the following:

while (true) {

think;

wait(mutex);

wait(fork[i]);

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

signal(mutex);

eat;

signal(fork[i]);

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

}

All semaphores have been initialized to 1.

a) Is deadlock possible?

b) Is fairness guaranteed? That is, is indefinite postponement for an individual philosopher possible?

c) Describe any other undesirable aspects of this proposed solution, if any. Explain your answers.