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. All strings over {0, 1} containing both 11 and 010 as substrings. {w Element {a, b, c, d, e}* | 1^st symbol of w notequalto the last symbol}. All strings over {0, 1, 2,...,9} such that the final digit has not appeared before. {we {0, 1, 2,...,9}* | w corresponds to the decimal encoding, without leading 0's, of an odd natural number} {w Element {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. 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. All strings over {0, 1} containing both 11 and 010 as substrings. {w Element {a, b, c, d, e}* | 1^st symbol of w notequalto the last symbol}. All strings over {0, 1, 2,...,9} such that the final digit has not appeared before. {we {0, 1, 2,...,9}* | w corresponds to the decimal encoding, without leading 0's, of an odd natural number} {w Element {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