A grammar is said to be in Chomi"Y normal form (CNF) if it is a-free and each non-e-production is of the form
a) Give an algorithm to convert a grammar into an equivalent Chomsky normal form grammar.
b) Apply your algorithm to the expression grammar (4.10)