5. (10 points) (i) Give a regular expression for the language accepted by the following nfa Mi over {a,b: a, b 72 94 (ii) Using the power-set construction algorithm, convert the above nfa Mi into an equivalent dfa M2. Include any necessary trap states in M2