This a question on algorithm and has multiple parts. Please read carefully and answer them with clear explanations. Thank you.

on set S, where Question 2 (17+9 points): Let set SA, B, C!. Consider the relation R R- ((A, A)). Is R reflexive? Is R symmetric? Is R transitive? Justify your answer in each case. Now consider the relation R' on set S, where R,n other words the empty relation on set S. Again prove or disprove: R' is reflexive, R' is symmetric. (b) Is o transitive? First, state what this means using definition of transitivity, and then try to prove it your answer carefully with the definition of o and some algebra/calculus