Use algorithm 1 to find the transitive closures of these relations on {a, b, c, d, e}. a) {(a, c), (b, d), (c, a), (d, b), (e, d)} b) {(b, c), (b, e), (c, e), (d, a), (e, b), (e, c)} c) {(a, b), (a, c), (a, e), (b, a), (b, c), (c, a), (c, b), (d, a), (e, d)} d) {(a, e), (b, a), (b, d), (c, d), (d, a), (d, c), (e, a), (e, b), (e, c), (e, e)}.

step-by-step explanation:

if you meant, "on the way from (3, 2) to (3, 14):

x does not change; y increases by 12.

ensure that you have copied down this problem correctly.   .

won't that be plagrisim thought?

step-by-step explanation:

6(h+1)/2=a

a=area

step-by-step explanation:

its the same thing as a square or rectangle but after multiplying two sides you need to divide it by two.