I. Construct a NFSA with at least one -moves to accept each of the following languages (a) The set of strings of O's and I's such that at least one of the last ten positions is a 1. (b)(a"bam 1 m, n 0 and n%3 = m%3} For instance, b, aba, aabaa, aaab, abaaaa, aaaaabaa are in the language, but abaa is not