I am confused on part 3 and part 4 of this question. This is the grammar I have which the professor had helped me with but not too sure where to go from here.

Part 1: Copy the definition of a grammar, exactly as given in class. Part 2: Write a grammar to generate the set of all legally nested parentheses. A string of parentheses is legally nested if there are the same number of left parentheses as right parentheses and if, as the string is read from left to right, the number of right parentheses never exceeds the number of left parentheses. Legally nested Not legally nested O 00 0) CO) 0 O(O) 000 Part 3: Use the formal definition of a grammar (Part 1) to specifically identify V. T, S and P for the grammar you wrote in Part 2. That is, list the elements in V, list the elements in T, etc. a Part 4: Write a paragraph that explains the significance of this example. In particular, describe some applications of the grammar from Part 2 to computer programming and writing code. P: : L 3 (9) ||