1. Consider the nondeterministic finite automaton (K, L, A, s, F) where K = {p,q,r}, } = {a,b,c}, s = p, F = {p} and A = {(p, c, 9), (q,b,r), (r,a,), (r,c,p)}. Find a regular expression for the language recognized by this automaton. Your regular expression should include all strings accepted by this automaton and no strings that are not accepted