(b) Briefly describe the technique called 'strict alternation' and discuss whether it provides a satisfactory solution to the critical section problem. (6 marks) (c) Consider the following pseudo-code: shared boolean flag [2]; flag [0] = flag [1] = FALSE; proc (int i) { } while (TRUE) { while (flag[(i+1) mod 2] == TRUE); // loop till FALSE flag [i] = TRUE; critical_section; flag[i] FALSE; } Explain whether this code solves the critical section problem for two processes. (8 marks)