2. (1 points) Convert the following NFA into a DFA: 0 1 {q,s} {9} * {r} {q,r} r {s} {p} *S {p} 3. (2 points total) Complete parts a) and b). a) (1.5 points) Convert the following NFA into a DFA: 0 1 {p} {p.9) 9 {C} {r,s} n {C} {p.r} t b) (0.5 point) Describe the language accepted by the finite automata in 3.a)