You implemented mutual exclusion with the compare$\_$and$\_$swap $()$ instruction in one

of the projects this semester. Here are the codes for the compare$\_$and$\_$swap$()$ and its

use to preserve mutual exclusion property.int compare$\_$and$\_$swap$($int $*$value$,$ int expected, int new$\_$value$)\{$If $(*$value $===$ expected$)\}$I$/$ part of codes for P$1$ and P$2$

while $($true$)\{$; $\backslash$lock $=0$;$\}$Explain briefly how mutual exclusion property could be broken among two processes

P$1$ and P$2$ if the above compare$\_$and$\_$swap$()$ operation is not guaranteed to be atomic

with step$-$by$-$step instructions from your example simulation. $(8$ points$)$