(c) Consider the following binary relation R C S x S, where S = {a, b, c, d, c, f, g): R = {(a, a), (a, b), (b, a), (b, d), (c, b), (d, a), (d, c). (e, f), (f.e ), (f.g) ). This relation can be represented by a directed graph as below. e i. (2 marks) What is the minimum number of elements in S x S you need to add to make R reflexive? ii. (2 marks) symmetric? iii. (3 marks) Pick a minimion number of elements in S x S to add to R to make it become transitive