5. Convert the following nondeterministic finite automaton with e-transitions (see Figure 1 below), M, to an equiva- lent nondeterministic finite automaton Mi, and then using the Subset Construction to convert M1 to an equivalent deterministic finite automaton M2 with its inaccessible states removed. Explicitly and briefly write down each step which you perform, such as: (1) Computing all the e-closures of the states of M (the notation E() introduced in page 56 of [sip12), and showing complete state-transition diagrams of Mi and M2