Please show clear diagram.
3. (20 points) Consider the nondeterministic finite automaton M = (K,E,,s,F), where K={qo,q1,q2}, 2={a,b}, s = qo F={qo,q2} and ={(qo,a,q1),(q1,b,q2),(q2,a,qo),(q2,b,qo),(q2,e,qo)}
(1) Draw the state diagram for the nondeterministic finite automaton. (2) Derive the configurations to show whether the string abab is accepted or rejected by the nondeterministic finite automaton.