1. Construct a NESA with at least one s-moves to accept each of the following languages. (a) (we 10,1)* | w corresponds to the binary encoding of a positive integer that is (b)(a"ba" | m, n 20 and n%3 m%3} For instance, b, aba, aabaa, aaab, abaaaa, (c) (we (a,b* | w contains two consecutive b's that are not immediately followed by an divisible by 16 or is odd. aaaaabaa are in the language, but aba is not. a'). For example, abbabb, bbbab are in the language