1. Consider the nondeterministic finite automaton (K,S, A, S,F) where K = {p,q,r}, { = {a,b,c}, s = p, F = {p} and A = {(p,c,q), (q,b,r), (q,a,p), (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. Try to do it with no more than two stars and one union