Construct an NFSA to accept each of the following languages Make sure that your NFSA contains at least one nondeterministic state, but no epsilon-moves are allowed. (a) All strings over {0, 1} containing both 11 and 010 us substrings. (b) {w {a, b, c, d, e}* | 1^st symbol of w notequalto the last symbol}. (c) All strings over {0, 1, 2, ..., 9} such that the final digit has not appeared before. (d) {we {0, 1, 2......9}* | w corresponds to the decimal encoding, without leading 0's, of an odd natural number} (e) {w {0-9}* | w contains a substring that is divisible by 3}. For example, 32, 1115, 101, 14278 are in the language, but 22, 47 are not