Problem $7.(6$ points$)$: For this problem, assume that x is an $32-$bit int. For reference, we will begin counting bits, nibbles, and bytes of x from the least significant bit, so the most significant bit is the $32$nd bit and the most significant nibble is the $8$th nibble. This counting is $1-$based so the least significant bit is bit $1$ and the next bit is bit $2,$ etc. $1.$ Give a C expression that will return the $2$nd Byte of x as a char using only bit$-$level operators, shift operators, and $1-$byte constants. As an example, if x $=0$x$12345678$ then the C expression should return $0$x$56.$