1. (30 point) For each i-1,2 and 3, compose a grammar Gi, such that L(Gi) = H,, where (a) Hi -L(M1) where M1 is the following DFA 91 02 73 0,1 FIGURE 1.4 A finite automaton called M1 that has three states State, for each grammar Gi (i -1, 2, 3), the set of variables, the set of terminals, the set of production rules, with each rule being a variable and a string of variables and terminals, and, the start variable. for the grammar clearly. Give reason(s) to support your answer to each case. The reason(s) given for each case should be concise. Do not use more than three complete sentences for each case