Please include clear attached picture of the constructed graph.

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={w w contains no fewer than three 1 s over =(0,1)}