Explain in detail what goes wrong in the following variation of Peterson's algorithm:

$(2$ Marks$)$

Process $P_i$ :

do $\{$

flag $[i]=$ TRUE;

turn $=i$;

while $($flag$[$j$]$ && turn $==$ j$)$;

$[i]=$