Hello! I need assistance with this problem from the theory of computation, and I am using jflap (not sure if there are others) when creating the NFA M.

Also another quick question, what do productions P symbolize? Like if C was an input it would represent 0B?

Thank you!

2) (8 pts) Given the regular grammar G = (V, S, T, P) where V = {A, B, C, S}, T = {0, 1} and productions P defined below, S+00A 1B A OA 2 B 11C1 COB a) Construct an NFA M such that L(M)=L(G) b) Give a regular expression r such that L(r) = L(G)