$```$

#states

a

b

c

d

#initial

a

#accepting

d

#alphabet

$0$

$1$

#transitions

a:$0>$a

a:$1>$a

a:$1>$b

b:$1>$c

c:$0>$d

c:$1>$d

$```$

Follow the NFA to DFA algorithm learned in class to convert it to a deterministic finite automata $($DFA$).$ Use the labeling convention seen in class where each DFA label indicates which states the NFA could be in and the letters are written in increasing order $($eg$,$ abc would indicate the NFA could be in state $\backslash (\backslash$mathrm$\{$a$\},\backslash$mathrm$\{$b$\}\backslash )$ or c $).$ Answer the following questions. $($Type only lowercase letters; no punctuation or spaces.$)$

How many states are in your DFA?

How many accept states are in your DFA?

In the following, the states ad and abcd may not actually exist in your DFA, but answer the questions as if they did exist.

When in state ad what state do you go to when consuming a $0?$

When in state ad what state do you go to when consuming a $1?$

When in state abcd what state do you go to when consuming a $0?$

When in state abcd what state do you go to when consuming a $1?$