Use photo below

Before we can implement a scanner, your machine has to become deterministic.

$Trs(q1,a)=\{q1,q2\}$

$Trs(q1,b)=\{q1\}$

$Tr(q2,a)=\{q2\}$

$Trs(q2,b)=\{q2,q3\}$

$Tr(q3,a)=\{q3\}$

$Tr(q3,b)=\{q3\}$

A$)$ DFA: $Trs{(}^{\text{'}}q{1}^{\text{'}},a)={?}^{\text{'}}q1q{2}^{\text{'}}$ new

$--$ Then from each new resulting state, give Trs on a and $b$

until there are no more new states $[11$ pts$]$ : $"??"$

$--$ Then draw the resulting DFA showing all the Trs$\text{'}$s and mark all final states $[7$ pts$]$ : $"??*$

B$)$ What is the language accepted by this DFA? To answer, give its RE matching your DFA $[7$ pts$]$ :