Theory of computation:

2. Using nondeterminstic finite automatons give a nondeterministic finite automaton that gives the union of: L1=: w | w contains no more than 30 's over =(0,1) \} and L2={ww contains no fewer than three 1 s over =(0,1)}