consider the following relation over the domain {a, b, c, d, e, f, g, h}:
R={(a,b),(c,d),(b,d),(e,f),(e,g),(h,h)}
(a) (10 points) If you take the reflexive, symmetric, transitive closure of R , what are the equivalence classes? (Remember, an equivalence class is a set of objects, not tuples.) You should not have to construct the closure to answer this question. (b) (10 points) Let R∗ be the reflexive, transitive closure of R to make a partial order. Draw the Hasse diagram for R∗. Remember, a Hasse diagram shows a partial order without reflexive and transitive edges, and orders elements by height: if x⊑y, then x is lower than y in the diagram.