(a) Define the following, given that A and B are sets: (i) cartesian product of the sets (ii) binary relation between A and B. Given a set S; when is the binary relation of the set said to be; (iii) reflexive (iv) symmetric (v) transitive (b) Define the transition graph. When is a word accepted by a transition graph (c) Draw the transition graphs corresponding to these regular expressions (1) R=0 +11 + 0*1 (ii) R = (1+0) or (i) R = [10+ (0+11)0*111