1.

2.

Given the alphabet ? = {0,1}, using at most 3 states, design an NFA which accepts the following languagel: L = {w e E*| w consists of only Os or only 1s} U {f}. Examples: 000000 should be accepted. 11110 should not be accepted. 11111111111111 should be accepted. 100000000000 should not be accepted. Given the alphabet ? = {0,1}, using at most 8 states, design an NFA which accepts strings that satisfy AT LEAST ONE of the following conditions: The string is of length exactly 4. The string contains the substring "01". Examples: 00 should not be accepted because it violates both conditions. 1111 should be accepted because it satisfies the first condition. 0101 should be accepted because it satisfies both conditions. 11111101 should be accepted because it satisfies the second condition