Operator Precedence in C++

This question is from the 2022 CSP examThis problem is about bitwise operations, read the questionFirst, look at the precedence: left shift operator > bitwise AND > bitwise ORNew word: unsignedshort is two bytes = 16 bits, and since it is unsigned, there is no sign bitSince x and y do not exceed 15, the maximum binary representation is 1 1 1 1Let’s look at the results of these equations after computationFor example: x = a b c dx << 2 = a b c d 0 0 a b c d 0 0 | a b c d = a b (a/c) (b/d) c d0x33 is hexadecimal => 0011 0011After ANDing => a b 0 0 c dSo if x is a b c d, after line 9 the result is a b 0 0 c dSimilarly, the result of line 10 is a 0 b 0 c 0 d Lines 11 and 12 are similar2 => 0010 => 0000100The result of input 2 2 should be 12 (1100), thus 3 4 5 yields the result, substituting 209 for the sixth questionDetermine respectively √ ×