Given below is a DFA for a language which accepts even number of $0\text{'}$s followed by even number of $1\text{'}$s$.$ Create a context free grammar corresponding to this DFA using only the algorithm taught in the lecture $($a grammar not following the algorithm will not be considered correct$).$ Write all the elements of the grammar, not just the production rules. $(20$ marks$)$

Use the steps from the lecture to convert the grammar obtained in a$)$ to Chomsky Normal Form

$(30$ mark$)$ please sjow all working and clearlt answer quesrion $1$ and $2$