Construct a NFSA (non deterministic finite state automata) with at least one -moves to accept each of the following languages. (a) {w {0,1}* |

Construct a NFSA (non deterministic finite state automata) with at least one ε-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 ⁿ ba ^m | m, n ≥ 0 and n%3 = m%3} For instance, b, aba, aabaa, aaab, abaaaa, aaaaabaa are in the language, but abaa is not.