Can anybody explain these questions? They are similar. Thank you for the help.

3. Let S be the set of all 32-bit patterns of 0 and 1 (strings of zeros and ones, of length 32) x R y if x and y have the same number of ones (a) Is R an equivalence relation on S? Justify your answer (b) If R is an equivalence relation, how many different equivalence classes are there? Justify your answer. 4. Let N be the set of all nonnegative integers 0, 1, 2,... . Cartesian product N x N by Define a relation R on the (a,b) R (c,d) f atd btc (a) Which of the following are true? (2,8) R (0,6) (b) Determine whether R is an equivalence relation on N N. (c) If R is an equivalence relation, describe the equivalence classes of (5,5), (6,2) and (5,9). Describe in general the equivalence class of (a,b)