(a) {W E {a,b}* | w does not contain aba as a substring}; (b) {W E {0,1}* | w contains an even number of both O's and ls}. In both cases, design a regular expression describing the language, by first constructing a finite automaton recognising it, and then converting the au- tomaton in a systematic manner into the corresponding expression