Design right-linear context-free grammars for the following languages: (i) {w {a,b}* | w does not contain aba as a substring}; (ii) {w {0,1}* | w contains an even number of O's and an odd number of 1's). first de- sign a finite automaton for the language in question and then translate the automaton into the corresponding right-linear context-free grammar. In ad- dition to the final solutions, also show the intermediate phases, e.g., the automata that you designed