Draw an FA accepting the indicated language over {a, b}: A. The language of all strings containing exactly two a’s.
B. The language of all strings containing at least two a’s.
C. The language of all strings that do not end with ab.
D. The language of all strings that begin or end with aa or bb.
E. The language of all strings not containing the substring aa.
F. The language of all strings in which the number of a’s is even.
G. The language of all strings in which both the number of a’s and the number of b’s are even.
H. The language of all strings containing no more than occurrence of the string aa.
I. The language of all strings containing both bb and aba as substring.
J. The language of all strings containing both aba and bab as substring.