Let $\backslash$Sigma $=\{0,1\}($a$)$ Construct a DFA that recognises all words over $\backslash$Sigma except the empty word $($b$)$ Construct a DFA that recognises the language $\{$ w in $\backslash$Sigma $*$ : w contains at least two $0$s and at most one $1\}($c$)$ Construct a DFA that recognises the language $\{0^\{2$m$+1\}1^\{3$n$\}$ : m$,$ n in $\}($d$)$ Construct an NFA that recognises all words over $\backslash$Sigma except the empty word $($e$)$ Construct an NFA that recognises the language $\{$ w in $\backslash$Sigma $*$ : w contains an even number of $0$s$,$ or exactly two $1$s $\}($f$)$ Construct an NFA that recognises the language $\{$ w in $\backslash$Sigma $$ : w does not contain $011$ as a substring $\}$