Consider the following NFA with $\backslash$Sigma $=\{0,1\}$

a$.[5$ marks$]$ Covert the NFA to DFA.

b$.[5$ marks$]$ Find the regular expression for the FA$.$

c$.[5$ marks$]$ Explain in English the language accepted by the FA$.$

d$.[10$ marks$]$ Using Pumping Lemma prove that the language

L $=\{$anb

n $|$ n $>=0\}$ is not a Regular Language.