Perform the bitwise operation AND on the numbers ~7 & ~8
Since Number 1 of 7 is not in binary form, we need to convert it to binary format From this conversion, we get 111 as our binary number
Since Number 2 of 8 is not in binary form, we need to convert it to binary format From this conversion, we get 1000 as our binary number
Because you had a negation sign out front for number 1, we need to switch all 1's with 0's and all 0's with 1's 1 → 0 1 → 0 1 → 0 Our negation number is 000
Because you had a negation sign out front for number 2, we need to switch all 1's with 0's and all 0's with 1's 1 → 0 0 → 1 0 → 1 0 → 1 Our negation number is 0111
We need to make sure that each of our binary representations has a length of 4, the length of our longest binary number
Digit 1:  0000 AND 0111
For a bitwise AND operation, both bit 1 AND bit 2 need to be 1 For bit 1, this is not the case: 0 AND 0 = 0
Digit 2:  0000 AND 0111
For a bitwise AND operation, both bit 1 AND bit 2 need to be 1 For bit 2, this is not the case: 0 AND 1 = 0
Digit 3:  0000 AND 0111
For a bitwise AND operation, both bit 1 AND bit 2 need to be 1 For bit 3, this is not the case: 0 AND 1 = 0
Digit 4:  0000 AND 0111
For a bitwise AND operation, both bit 1 AND bit 2 need to be 1 For bit 4, this is not the case: 0 AND 1 = 0