B. (10pt) Use the construction given in the proof of Theorem 1.45 to give the state diagrams of NFAs recognizing the union of the given two languages. 7. (Spt) {ww begins with a 0 and ends with a 1} U {wl the length of w is at most two.} List the first 5 strings in the language: List the first 5 strings that are not in the language: 8. (Spt) {wl w contains the substring 0101} U {wl w does not contain the substring 110) List the first 5 strings in the language: List the first 5 strings that are not in the language