Let A be the set of all bit strings of length 25. Let R be the relation defined on A where two bit strings are related if they have the same number of ones.
(a) Show that R is an equivalence relation.
(b) Enumerate one bit string from five different equivalence classes of R.