Give NFAs that recognize the following languages, S={0,1}:

1. {w/w begins with 1111 ans ends with 0} (6 states)

2. {w/w contains at most four 0 } , (5 states)

3. {w/w is a substring of 011101 }, as few states you can