Please find questions in screenshot

Define a binary relation R on the set A = {binary strings of length 4} as follows: For all strings s.te A, s Rt if and only if s and t have the same number of ones. Important: Include all relevant details in your proof. If variables appear in your proof. clearly indicate what they represent. Clearly state your assumptions. (a) Prove that R is reflexive. (b) Prove that R is transitive. (c) Prove that R is transitive