i need the answer of this Automata and Computability course question.Open the image in new tab for better view.

CNF 8.0 points possible (graded results hidden) Consider the following Context Free Grammar over (a, b, d, where is the Start Variable. S-ACD A - AC | CIC C-Cla D-aDa bDb|d16 Convert the above grammar into Chomsky Normal Form and answer the following questions. 1. Do we need to add a new Start Variable? If yes, select the new grammar. If no, select the option with the given grammar. SO -> 5 SACD A- aACaC | 8 C-acia D-aDa bDb ds S - ACD A - ACCI C-Cla D-aDa bob de 2. After removing e-productions, what should be the resultant grammar? OS-> ACDACIC A -> Abac C-> acla D -> DabDbd OS -> ACD ACCD A -> ACCI C -> aC a D-> DabDb ldaa bb OS-> ACDACIC A -> ACC C-> acla D -> aDa bob daa bb OS-> ACD ACCDC A -> ACC C-> acla D-> aDa bDb |daa bb 3. After removing unit productions, what should be the resultant grammar? S-> ACD|AC|CD A -> AC aC C-> acla D-> DabDb | daal bb OS -> ACD ACCDC A-> AC aC C-> Cla D-> DabDb | aa bb OS-> ACDAC | CD |aca A-> AC aC C-> aC a D-> DabDbl daai bb OS -> ACD ACCD A -> AC aC C-> acla D -> DabDbaal bb 4. What should be the final Chomsky Normal Form? OS-> RDCDXC A->RIXC C - X D -> XP|YO|XXYY X- Y-> P-DX Q- DY R-> AC OS ACTIAC A-XACJXC C-Cla D-XPLYOXXYY Xa Y- P-DX -> DY OSRDJACOXC A - XRIXC C-XCH D -> XP|YObb Yb PDX O -- DY R-> NC OS-> RD AC|CD|XC| A-> XRaC C-> XCIX D-XPQXXYY X->a Y- b P - DX O - DV R - AC