Construct an NFSA to accept each of the following languages. {x Element {a, b}* | x does not have Ababa as a substring} {x Element {0, 1, 2}* | the sum of the digits of x is divisible by 3}. For example, epsilon, 0, 111, 10002, and 222 are in the language, but 1, 11, and 1102 are not. {x Element {0, 1}* | x corresponds to the binary encoding of a positive integer that is divisible by 7} {x Element {0, 1, 2,...,9}* | x corresponds to the decimal encoding, without leading 0's, of an odd natural number}