2. NFA: Let L and L2 be arbitrary languages and let Mi and M2 below be diagrams representing the NFA for them (a) Explain (as if to a 1030 student) the key differences between the languages LiUL and (L1UL2)*. Give an example of a string that is in one but not in the other and vice versa . Answer in Notes: Let L1 = {a) and Li {b). (LU L) contains strings that either only contain a's or only contain b's. On the other hand, (L1 UL2)* contains strings that contains only a's and b's. Let w = ab. It is in the second and but not the first. Everything in the first is in the second (b) Draw an NFA for the language Li U L2. (c) Draw an NFA for the language (Li U L2)". 2. NFA: Let L and L2 be arbitrary languages and let Mi and M2 below be diagrams representing the NFA for them (a) Explain (as if to a 1030 student) the key differences between the languages LiUL and (L1UL2)*. Give an example of a string that is in one but not in the other and vice versa . Answer in Notes: Let L1 = {a) and Li {b). (LU L) contains strings that either only contain a's or only contain b's. On the other hand, (L1 UL2)* contains strings that contains only a's and b's. Let w = ab. It is in the second and but not the first. Everything in the first is in the second (b) Draw an NFA for the language Li U L2. (c) Draw an NFA for the language (Li U L2)