Computer science answer both the questions else will downvote the answer
Extracted text: Question 2 Composite relations can be thought of as composite functions. If S is a relation from set A to B, and R from B to C, then composite relation Ro S passes an input acA first to S, then passes the return beB to R, and finally returns the output ceC, resulting in the set of pairs (acA, ceC). Relations R and S are shown below: • R = {(1,2), (2, 3), (2, 4), (3, 3), (4, 1)} • S= {(1,1), (1, 4), (2, 3), (2, 4), (3, 1), (4, 4)} Write the sets of pairs of composite relations (i) Ro R and (ii) Ro S. Question 3 Let R and S be relations from A to B. Prove (R C S) = (R-1C s-1). 1