Suppose CPU on which an OS runs support an atomic instruction of fetch$\_$and$\_$increment$()$ as follows: int fetch$\_$and$\_$increment$($int $*$x$)\{$ last$\_$value$=*$x; $*$x$=*$x$+1$; return last$\_$value; $\}$ Show that if the wait and signal operations are not executed atomically, then mutual exclusion may be violated. Show how to implement mutual exclusion which may need to avoid starvation. Also check the progress and bounded waiting conditions.