Please explain all the steps

Solve question 3 and 4

*C C L 9) Design a NFA to recognize the following set of strings (lab,cab,dab) over the alphabet (a,b,c,d,l). Convert the NFA into a DFA. 2+4 Convert the following epsilon-NFA to a DFA and describe the language. 3+2 -> p (0,r) {a} a $ {p} {r} {0,0) 5) Design an epsilon-NFA for the language over {a,b,c) of all strings which do not contain all the three symbols. Convert this to a DFA. 3+3