Question attached bellow

(04) Let E = {(1,1),(3, 2)(3,5), (4, 3),(5,5), (6, 2)} be a binary relation on the set {1, 2,3, 4, 5,6} . a) b) C) d) e) f) Draw a graph representation of E. Write a Boolean matrix representation of E. Compute the smallest reexive relation that contains E. Give a graph and the matrix. Draw the smallest symmetric relation that contains E. Give a graph and the matrix. Draw the smallest transitive relation that contains E. Give a graph and the matrix. Draw the smallest equivalence relation that contains E. Give a graph and the matrix