For all the following parts, the alphabet is A = {a, b}. a) Give a regular expression for the language that contains: - all strings that end with the sequence 'aba' - or also all strings that have two consecutive a's b) Construct an NFA from this regular expression (you can use the constructions presented in class, but it is preferable to construct it intuitively from the regular expression so that your NFA turns out to be smaller). c) Convert the NFA to a DFA by using the set construction that was presented in class.