It's a computer system course. Just explain the answer and If u were asked to do this, how would you approach the answer.

int allEvenBits (int x) t //Mask-01010101 where all even positions are 1 //shift it over by 2 bytes and add it again to make it 32 bits long //x&masker to get where the x and mask match up (mask only on even positions) /Xor so if it's all the same, you get 0 which gets flipped by the bang to 1 int masker= (0x55 > Max ops: 12 Rating: 2 int anyoddBit(int x) //Mask-10101010 //Shift by 1 byte each timewhile doing a XOR with our mask to get 01-1 //(we have 0's in odd-numbered bits in our mask so our mask will be 01010101) //return x&masker flipped twice int masker= (0xAA); masker-(masker> Max ops: 25 3 sRating: 2