DFA to RRG

      Below are descriptions of a DFA D. Convert it to a right regular grammar (RRG) recognizing L(D) using the procedure described in lecture and in the textbook page 107). Submit your answer in a file with extension '.cfg'. D: states = {a,b,c,d,e,f,g,h} input_alphabet = {0,1} start_state = d accept_states = {a,b,e,f,h} delta = a,0 -> f; a,1 -> a; b,0 -> h; b,1 -> d; c,0 -> c; c,1 -> h; d,0 -> h; d,1 -> f; e,0 -> c; e,1 -> a; f,0 -> g; f,1 -> e; g,0 -> d; g,1 -> c; h,0 -> b; h,1 -> d;