X 3. (20 points total) Complete parts a) and b). a) (15 points) Convert the following NFA into a DFA: >p {p} {p,q} 9 {t} {r,s} r {t} {p,r) *S *t b) (5 points) Describe the language accepted by the finite automata in 3.a)