Fill in the blanks below for the computation of 7 div 2 using the computational grammar in Example 9-4: S1 → T T1 → 1S TS → A SS → 1

A recursive way to define the set E C Z of even numbers is: • Base case: 0 E E • Constructor cases: If n E E, then ... Choose all the following cases needed to complete this defintion. O n +1 € E, if n > 0 n + 2 € E, ifn >0 —п€ E, if n 0

5. Let L = {a" blak | k > n +l}. a. List all strings of length 7. (use power notation: i.e. aabbbbaaaaaaaa is a²bªa³)

Construct a nondeterministic FSA 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 P = {S → 1A, S→ 1B, S→ OC,S → 0,S→ 2, A → OB, A → 0, B → 1B, B → 0, B1, C → 04}