2) here are two relations defined on the set {a, b, c, d): s= { (a, b), (a, c), (c, d), (c, a)} r={ (b, c), (c, b), (a, d), (d, b)} write each relation as a set of ordered pairs. a) sor b) ros c) sos

Given relations defined on the set {a, b, c, d},

S= { (a, b), (a, c), (c, d), (c, a)}

R={ (b, c), (c, b), (a, d), (d, b)},

Since, SoR(x) = S(R(x)),

So, SoR(a) = S(R(a)) = S(d) = ∅,

SoR(b) = S(R(b)) = S(c) = d and a,

SoR(c) = S(R(c)) = S(b) = ∅,

SoR(d) = S(R(d)) = S(b) = ∅,

Thus, SoR = { (b,d), (b,a) }

RoS(a) = R(S(a)) = R(b) = c and RoS(a) = R(S(a)) = R(c) = b,

RoS(b) = R(S(b)) = R(∅) = ∅,

RoS(c) = R(S(c)) = R(d) = b and RoS(c) = R(S(c)) = R(a) = d

RoS(d) = R(S(d)) = R(∅) = ∅,

Thus, RoS = { (a, c), (a, b), (c,d), (c, b) },

SoS(a) = S(S(a)) = S(b) = ∅ and SoS(a) = S(S(a)) = S(c) = d and a

SoS(b) = S(S(b)) = S(∅) = ∅,

SoS(c) = S(S(c)) = S(d) = ∅ and SoS(c) = S(S(c)) = S(a) = b and c

SoS(d) = S(S(d)) = S(∅) = ∅,

SoS = { (a, d), (a, a), (c, b), (c, c) }

easy its decreasing

step-by-step explanation:

because its top point is at the to of the graph on the left side (atleast from the veiw i see it) now if that top point wast in the lower part of the graph it would be increasing hope this have a nice day

answerim :

n

step-by-step explanation:

im not sure but my dad knows