Discrete - relation-graph

Given a relation R on {1, 2, 3, 4, 6, 12) where aRb means a | b. (i) Draw a digraph representation of relation R. (ii) Compute the matrix M_R which represents relation R. (iii) Determine whether R is a equivalence relation. (iv) Determine equivalence class of [3]_R. Suppose that a computer has only these memory locations, 0, 1, 2, ..., 29. Use the hashing function h where h(x) = (x + 5) mod 30 to determine the memory locations in which 100, 132, and 97 are stored