Dont use others answers please!!do it as a table like sown on the picture please (as an example)will leave you feedback!!Thank you!Suppose we wanted to RESET Bits 0, 1 and 2 in the byte 10101011, but leave all the other bits as they were. Show the value, mask and the result of the bitwise logical operation. 76.431Bit Position111Data1111Mask111XOR result

Given value of data is '10101011'. The requirement is we want to RESET bits 0,1,2 in the given byte data and leave all the other bits as they were. Some of the bitwise logical operators are OR, AND, XOR. The truth table for OR is: A B A|B 0 0 0 0 1 1 1 0 1 1 1 1 Based on the truth table, we can see that making a bit to 0 using OR has least probability. The truth table for AND is: A B A&B 0 0 0 0 1 0 1 0 0 1 1 1 When compared to bitwise OR, the probability of resetting the bits to 0 is high for bitwise AND. Since the bits that should be changed are 0,1,2 the mask that best suites for resetting the data is '11111000'. 7 6 5 4 3 2 1 0 BIT POSITION 1 0 1 0 1 0 1 1 DATA 1 1 1 1 1 0 0 0 MASK 1 0 1 0 1 0 0 0 AND RESULTThe truth table for XOR is A B A^B 0 0 0 0 1 1 1 0 1 1 1 0 Since the bits that should be changed are 0,1,2 the mask that best suites for resetting the data is '000001111'. 7 6 5 4 3 2 1 0 BIT POSITION 1 0 1 0 1 0 1 1 DATA 0 0 0 0 0 1 1 1 MASK 1 0 1 0 1 1 0 0 XOR RESULT