What are the disadvantages of Peterson’s solution for critical-section problem? Code below shows the solution to two process mutual exclusion problem. Process Pi
do {
flag[i] = true;
turn = j;
while (flag[j] && turn == j);
critical section
flag[i] = false;
remainder section
} while (true);
Process Pj
do {
flag[j] = true;
turn = i;
while (flag[i] && turn == i);
critical section
flag[j] = false;
remainder section
} while (true);

Answer True or False to the following questions:

a. This algorithm satisfies the "mutual exclusion", "progress" and "bounded waiting" condition.
b. This algorithm has a flaw as the variable "turn" can be modified by both processes at the same time.
c. This algorithm may cause "deadlock" if both processes set their flags to True at the same time.
d. This algorithm satisfies only the "mutual exclusion" and "progress" condition