An nfa in which $($a$)$ there are no $-$transitions, and $($b$)$ for all qinQ

and all ain$,(q,a),$ it contains at most one element, is sometimes

called an incomplete dfa. This is reasonable because the conditions

make it such that there is never any choice of moves.

For ${\displaystyle \underset{?}{\overset{?}{}}}=\{a,b\},$ convert the incomplete dfa below into a standard dfa.