Suppose a machine’s instruction set includes an instruction names swap that operates as follows (as an indivisible instruction):

swap (boolean *a, Boolean *b)

{

boolean t;

t = *a;

*a =*b;

*b = t;

}

Show how swap can be used to implement the P and V operations.