(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 = (10) 01 - (iii) R = [10 + (0 +11)0*111 Question Two (a) For any set S of strings, prove that s' = 5" (b) Illustrate the proof in (a) above, using these languages (1) S={a,b} (ii) S = {aa, bbb)