Please quickly , thanks !!!

Figure 2: Figure For 1911.5 Qn {a} List all strings of lengths 2, 3, 4, 5 and 5 that are accepted by the DFA of Fig. 2. {b} From your answer to part {a}1 you can see that all accepted strings can be described using the substrings ab and she. Use this observation to derive a regular expression description of the language accepted by the DFA of Fig. 2. {c} Use your answer to part {b} to construct an equivalent 3-state NFA that recognizes the same language. Explain why your NFA is correct