Consider the following code segment: $[$ Process P i:; do $\{$; flag$[$i$]=$ TRUE;; turn $=$ i;; whProcess $P_i$ :

do $\{$

flag$[$i$]=$ TRUE;

turn $=i$;

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

$=1=1=0===1$ile $($flag $[$j$]$ && turn $==$j$)$ ;; flag$[$i$]=$ FALSE;

$\}$ while $($TRUE$)$; A$.$ What is the problem with this code when we have two processes P$\_$i and P$\_$j $?$ B$.$ Suggest a correction to this problem? $]$