kindly solve this....or refer me to the course name where i can post this

Consider the following program boolean blocked[2]; int turn; void P(int id) { while (true) { blocked[id] = true; while (turn l= id) { while (blocked[1-id]); // do nothing turn = id; } If critical section blocked[id] = false; // remainder } } void main(){ blocked[e] false; blocked[1] false; turn = 0; parbegin(P(0). P(1)); // two Processes start concurrently This above algorithm is proposed for achieving the mutual exclusion between two processes. Find a counterexample that demonstrates that this solution is incorrect. [10 marks]