Construct a NFSA with at least one epsilon-moves to accept each of the following languages. (a) {w {0, 1}* | w corresponds to the binary encoding of a positive integer that is divisible by 16 or is odd}. (b) {a^nba^m | m, n greaterthanorequalto 0 and n%3 = m%3} For instance, b, aba, aabaa, aaab, abaaaa, aaaaabaa are in the language, but abaa is not. Given M_1 =({1, 2, 3, 4, 5, 6}, {a, b}, delta, 1, {6}), where delta is defined as follows. (a) Give a complete computation tree on M_1 for string aab. Is aab L (M_1)? (b) Find the equivalent NFSA M_2 without epsilon-moves for M_1. (c) Give a complete computation tree on M_2 for string aab. Is aab L(M_2)