$)$ Bit Manipulation: In the following questions assume the variable a is a signed integer and that the machine uses two$$s complement representation. Also assume that MAX INT is the maximum integer, MIN INT is the minimum integer, and W is one less than the word length $($e$.$g$.,$ W $=31$ for $32-$bit integers$).$ Match each of the descriptions on the left with a line of code on the right $($write in the letter$).$ You will be given $2$ points for each correct match. $1.$ a$\%2.2.$ Two$$s complement of a$.3.$ a$$a$.4.!$a$.5.($a $>0)?1$ : $0.$ a$.(($a $|($a $+1))>>$ W$)$ & $1$ b$.(($a $<0)?$ a $+1$ : a$)>>1$ c$.$a $-($MIN$\_$INT $+$ MAX$\_$INT$)$ d$.!(($a $>>$ W$)|!$a$)$ e$.(((0)<<1))$ & a f$.($MAX$\_$INT & a$)+(0)$ g$.(($a $(0))|$ a$)$