Design and draw the state diagram (graph-representation) of a deterministic finite-state automata that recognizes the language generated by the grammar G=(V,T,S,P) with vocabulary V={a,b,A,B,S}, terminals T={a,b}, start symbol S, and production rules P={S-> ?, S->aA, A->bB, B->ab}