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 = ({ , g.), , , 40, F) into an equivalent CFG as follows. Make a variable R, for each state gi of the DFA. Add the rule R, aR, to the CFG if ((qi,a))-Q3 s a transition in the DFA. Add the rule R,-+ if q, 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,S, R, S) that results. State diagram for DFA M (a) V- (b) = (c) R- (d) S =