Read n and a bit position (0 = least significant bit), and print Set or Clear depending on that specific
bit’s value in n.
This is the “check” third of the set/check/clear idiom from the lesson: build a mask with a single 1 bit at
position using 1 << position, & it with n, and compare the result against 0. Don’t forget the
parentheses around n & (1 << position) before comparing with != – bitwise operators bind looser than
comparisons, exactly as the lesson warns.