Question 6: Here is a context-free grammar: Good D - AB | CD BG 0 - AD 1 & + CD 1 1 BB TE AF 1 B1 EG 100 AG IBD Find all the nullable symbols (those that derive in one or more steps). Then, identify the true statement from the list below. D is not nullable. CC is nullable. B is not nullable. CA is nullable. Question 4: Suppose we execute the Chomsky-normal-form conversion algorithm described in the videos. Let A BCODE be one of the productions of the given grammar, which has already been freed of E- productions and unit productions. Suppose that in our construction, we introduce new variable X, to derive a terminal a, and when we need to split the right side of a production, we use new variables Y, Y2,... What productions would replace A - BCODE? Identify one of these replacing productions from the list below. CAY,B CYYX, CABY, 0 Y YD Question 5: Convert the grammar: S - A | B | 2 A COLD C1 TE C - D | E | 3 D EOT S Di IS to an equivalent grammar with no unit productions, using the construction described in the video. Then, choose one of the productions of the new grammar from the list below. O SE E + E01 CADO CE -> EO