Given an NFA M with the transition graph shown below.

a)Give a regular expression r such that L(r) = L(M)

b)Construct a regular grammar G such that L(G) = L(M)

b 91 93 qo 92 94