Theory of computing

This question is about context free languages a) Given below is a DFA for a language which accepts odd number of 0's followed by odd number of 1's. Create a context free grammar corresponding to this DFA using the algorithm taught in the lecture (15 marks) b) Use the steps from the lecture to convert the grammar obtained in a) to Chomsky normal form (10 marks) c) Enriching the language from a), we would like to have a language which has odd number of 0's followed by equal number of 1's i.e. L={0n1nn is odd }. Create a nondeterministic PDA for L