When a binary shift operation is performed binary data can be shifted right or left and a '0' is brought to fill vacated positions while the bit that is shifted out is discarded. Shift the 8-bit binary number that is equivalent to 0x18 right two, give the result in binary. When a binary rotate operation is performed binary data can be shifted right or left: the bit that is shifted out from one end will be brought back in on the other end. Rotate the 8-bit binary number that is equivalent to 0x5B left two, give the result in binary. For an 8-bit (byte) sized binary number, what mask and operation would you use to clear the lower nibble without changing the upper nibble? Mask (in binary) Operation