Given the alphabet sigma = {a, b}, design from imagination a nondeterministic finite automaton (NFA) accepting the following language: L(NFA) = {a^2k | k greaterthanorequalto 1} {a^3k | k greaterthanorequalto 1} {b^2k | k greaterthanorequalto 1} {b^3k | k greaterthanorequalto 1} Write the language L(NFA) as a regular expression. Transform the NFA designed at Step 1 into an equivalent DFA (that is, a DFA recognizing the same language). You must apply the approach presented in class. Minimize the number of states of the DFA obtained at Step 3. (Your DFA may have already a minimum number of states; if this is the case, you still have to justify it.)