Let M = (Q, 2,8,90, F) be the NFA, where Q = {90, 91, 92, 93, 94}, { = {0,1}, F = {93, 94} and S is defined as follows: 8(90,0) = 8(90, 1) = 8(91,0) = 8(91,1) = 8(42,0) = 8(q2, 1) = 8(93,0) = 8(93,1) = 8(94,0) = 8(94, 1) = {90, 91}, {qo}, {92, 93}, {q4}, {q0, 92}, {94}, 0, 0, 0, s Draw the transition diagram for M. Perform the subset construction on M to get a DFA. Draw the resulting DFA. Describe (informally) what language that is accepted by both automata