Let R be a relation consisting of all pairs (a, b) where a and b are bit strings of length at least five and a and b agree in their first five bits. Show that R is an equivalence relation on the set of all bit strings of length at least five.
Two strings a and b agree in their first k bits if the first k bits of a are equal to the first k bits of b.
I understand that in order for a relation to be considered an equivalence relation, it must be reflexive, symmetric, and transitive. But I am not sure how I would show this given the question above. Any advice would be appreciated.