6. (10 pts) Let R be the relation consisting of all pairs (x, y) such that x and y are strings of uppercase and lowercase English letters with the property that for every positive integer n, the wth characters in x and y are the same letter, either uppercase or lowercase. Show that R is an equivalence relation