1. Given the following regular expressions. Describe a finite automaton by drawing it's transition diagram to accept the set of strings denoted by each of the following regular expression. (20 pts) a). (abba) bbb ala b). bbb) (ab)*a S e e that the alphabet is create a te expression lo denote the set of strinstant with aband ending with ba. Also describe a fine automaton to accept this set o nts)