2. (10 points) For each part, describe a relation using the different representations asked for. (a) Let A {1, 2, 3, 4, 5, 6}. (i) Write out the relation R on A that expresses x | y (divides), that is if x | y then (x, y) R, that is describe the relation using the set enumeration methods (list all elements of the set). (ii) Draw the relation as a digraph. (iii) Describe the relation as a zero-one matrix (assume rows/columns are ordered numeri- cally). (b) Let R be a relation on a set A, illustrated below. 0 1 4 5 (i) Write out the sets A and R. (ii) Describe the relation as a zero-one matrix (assume rows/columns are ordered numeri- cally). (c) Congruence modulo 5 is a relation, R, on Z, where (x, y) E R means x = y (mod 5). Write out the set R in set-builder notation.