6. Give state diagrams of NFAs with the specified number of states recognizing each of the following languages. In all parts,2-cd) a. Accepts (w w has exactly 1 d's and an even number of c's) using four states. Example accept strings: ccd, cdccc, d ) b. Accepts (w | w ends in cdc) using four states. (Example accept strings: cccdc, ddcdcc) 7. Use Theorem 1.45 in the text (also given in class) to provide an NFA state diagram for a machine that recognize the union of the languages L1 and L2 below. Note -|0,1]. L1- (w I every even position in w has 1) L2 - (w I w has 3 or more characters, and the second symbol is 1)