17. The code given below is the solution to strict alternation problem. Discuss what problem is still there in this solution? [3]

Process 0 while(TRUE) { interested[0] = TRUE; while(interested[1]!=FALSE); critical_section(); interested[0] = FALSE; noncritical_section(); }

Process 1 while(TRUE) { interested[1] = TRUE; while(interested[0]!=FALSE); critical_section(); interested[1] = FALSE; noncritical_section(); }