Information for 5a:

Use the construction to give the state diagrams of NFAs recognizing the union of the languages described in L1 = {w| w is any string except 11 and 111} L2 = {w| every odd position of w is a 1} [That is, construct 2 NFAs and then perform the union of the languages]

Thank you!!

4a. Construct an NFA to accept {00,001}{1} 4b. Draw computation tree for the NFA obtained from question 5 a for the input string 00001001