ask a expertConvert the following NFA $($N$)$ to equivalent DFA $($D$).$ Here, $Q=\{1,2,3,4\}$ and $=\{a,b\}.$

a$.$ Find start state of $D.(5$ points$)$

b$.$ Find the set of accept state$($s$)$ of D$.$ Represent the set with F$.(10$ points$)$

c$.$ How many states $D$ will have? $(5$ points$)$

d$.$ Draw the transition table $(20$ points$)$

e$.$ Draw the DFA $(10$ points$)$

Define Pumping Lemma $($all $3$ conditions$)$ for the regular language contains

any string that contains $101$ as its substring$\}.$ Demonstrate the Lemma with appropriate

string and state diagram. $(15$ points $-5$ points for demonstrating each condition$)$