Below are descriptions of a DFA D. Convert it to a CFG recognizing L(D) using the procedure described in lecture D: a,b,c,d,e,f,g,hh {0,1} states = input-alphabet= startstate = accept-states = delta = - {a,b,c,d,e, a,e ->C; a,1- a; b,0 h; b1-ei c,0 ->g; C,1->h d,1> gi e,0-e; e,1 -e; f,0 -d f,1-C 0 -> g 9.1 f h,1-ai