Just choose one of them from 1.4 to construct a NFA. Thanks!

2. (2 points) Write and answer your own exercise. Pick any a regular language that you find interesting. You can take it from the examples in the readings, or from the Exercises 1.4 1.7 (pages 83-84). First note the language then construct a NFA. 1.4 Each of the following languages is the intersection of two simpler languages. In each part, construct DFAs for the simpler languages, then combine them using the construction discussed in footnote 3 (page 46) to give the state diagram of a DFA for the language given. In all parts, 2-fa, b fwl w has at least three a's and at least two b's} a. b. ^wlw has exactly two a's and at least two b's c. fwl w has an even number of a's and one or two b's] w w has an even number of a's and each a is followe e. {w w starts with an a and has at most one b) f. fwl w has an odd number of a's and ends with a b) g. swl w has even length and an odd number of as)