(c) Critically evaluate the strict alternation algorithm with reference to the mutual exclusion problem.

(b) Consider the following solution to the critical-section problem of two-processes: turn:= 0, busy : = false Pi: init-i while(true) { while (turn != i) { while(busy) { turn := i } } busy := true } crit-i busy : =false rem-i } For the following question either provide a proof, or show an execution where it fails. Explain whether the above code meets all requirements for mutual exclusion. [4 Marks]