Consider the following state diagram of an NFA $N$ over alphabet $\{A,B,C,D\}.$

$($a$)$ What is the language recognized by $N?$

$($b$)$ Use the subset construction to convert $N$ into a DFA recognizing the same language. Give the state diagram of this DFA $-$ only include states that are reachable from the start state.