1. In each part below, draw an FA accepting the indicated language over {a,b} (5% each). (a) The language of all strings containing exactly three a's. (b) The language of all strings that do not end with ab. (c) The language of all strings that begin or end with aa or bb. (d) The language of all strings in which both the number of a's and the number of b's are even. (e) The language of all strings containing both bb and aba substrings