NFA: q0 loop on 0,1 q2 loop on 0,1. q2 is final.

(q0) --- 0 -----------> (q1) --- 1 ---> ((q2))

q1 loop on 0,1

Trs(q0, 0) = {q0, q1}

Trs(q0, 1) = {q0}

Trs(q1, 0) = {q1}

Trs(q1, 1) = {q1, q2}

Trs(q2, 0) = {q2}

Trs(q2, 1) = {q2}

A) DFA: Trs(q0, 0) = q0q1 new

Trs(q0, 1) = q0 loop

Then from each new resulting state, give Trs on 0 and 1

And finish this until there are no more new states.

1. List all the Trs's here:

2.Then draw the resulting DFA showing all the Trss and mark all final states:

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