Chapter 9.4, Problem 26E

Algorithm 1 to find the transitive closures of these relations on {a,b, c, d, e}.

a) $\left\{\left(a,c\right),\left(b,d\right),\left(c,a\right),\left(d,b\right),\left(e,d\right)\right\}$

b) $\left\{\left(b,c\right),\left(b,e\right),\left(c,e\right),\left(d,a\right),\left(e,b\right),\left(e,c\right)\right\}$

c) $\left\{\left(a,b\right),\left(a,c\right),\left(a,e\right),\left(b,a\right),\left(b,c\right),\left(c,a\right),\left(c,b\right),\left(d,a\right),\left(e,d\right)\right\}$

d) $\left\{\left(a,e\right),\left(b,a\right),\left(b,d\right),\left(c,d\right),\left(d,a\right),\left(d,c\right),\left(e,a\right),\left(e,b\right),\left(e,c\right),\left(e,e\right)\right\}$