Construct a nondeterministic finite-state automaton that recognizes the language generated by the regular grammar G = (V, T, S, P ), where V = {0, 1, S, A, B}, T = {0, 1}, S is the start symbol, and the set of productions is
a) S → 0A, S → 1B, A → 0, B → 0.
b) S → 1A, S → 0, S → λ, A → 0B, B → 1B, B → 1.
c) S → 1B, S → 0, A → 1A, A → 0B, A → 1, A → 0, B → 1.