2. (7 points) In the book on page 107, the top paragraph describes a procedure for converting DFA to CFGs: You can convert any DFA M-((go, ,Yn), , ,go, F) into an equivalent CFG as follows. Make a variable Ri for each state qi of the DFA. Add the rule RiaR to the CFG if ((qi,a)-qi s a transition in the DFA. Add the rule R, if gi is an accept state of the DFA. Make Ro the start variable of the grammar. Apply this process to the DFA M with state diagram below and fill in the blanks in the formal definition of the CFG GM- (V,, R, S) that results. 92 State diagram for DFA M (a) V (b) - (c) R- (d) S