$($c$)$ Below is an NFA that recognises a certain regular language. Start by turning it into a DFA. Make it a complete DFA, so each state should have both an A$-$ and a B$-$transition, and it might be useful to include the Reject state.

Using the DFA you have created, answer the following questions about this language. Provide a brief justification for each answer using the DFA.

i$)$ Does this language contain the empty word?

ii$)$ What one$-$letter word does not belong to this language ${?}^{\text{'}}$

$1$

iii$)$ Which two$-$letter combination can not appear in any word in this language? Draw ir our as question requires ans show all working mathemtically