3. 10pt) Use the procedure described in Lemma 1.60 of the textbook to convert the following DFA into regular expression: a,b Note: Follow the procedure used in examples 1.66 and 1.68 of the textbook. Draw all the steps in your printout answer. Remark: Even though submitting 5 rejected and 5 accepted strings is not required, it is highly recommended. Think of the process as unit testing of your design