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)}.

y= 2x+7

changed to y= 5x +7

as slope is increased from 2 to 5

therefore it would be less steeper

so, option d) is correct

i think its a.

hope this

a and c

for infinitely many solutions we require both left and right sides to be equal

distribute and simplify

a

14 - 8x = 20 - 8x - 6 = 14 - 8x ← both sides equal so infinite solutions

b

6x - 54 = 6x - 54 + x = 7x - 54 ← not equal

c

4x + 16 = 4x + 10 + 6 = 4x + 16 ← both sides equal so infinite solutions

d

5x - 40 + 10 = 5x + 10

5x - 30 = 5x + 10 ← not equal