Q5) (15 pts)Let d is defined as the number of bit positions in which the two bits are different, denoted by d(S1; 52). For example, for the following strings of length 6: s= 101010; t = 111000 then d(s; t) = 2; Consider the set of all binary strings of length n. On this set, we define a relation R as follows: R = {(s, t) E RId(s, t) 1} Is R an equivalence relation?

Q5) (15 pts)Let d is defined as the number of bit positions in which the two bits are different, denoted by d(s1;s2). For example, for the following strings of length 6:s=101010;t=111000 then d(s;t)=2; Consider the set of all binary strings of length n. On this set, we define a relation R as follows: R={(s,t)Rd(s,t)1} Is R an equivalence relation