uct construction has six. Draw the full six-state DM EXERCISE 4 Consider the following three DFAs and the languages they denne: 0 0 L = {xay x {a, b}* and y a, b*} L = {xbybz | x, y, and z are all in {a, b]*} 4,5 L = {xaby | x {a, b}* and y e {a, b}*} Apply the product construction to create DFAs for each of the following languages. Label each state with the pair of states to which it corresponds. You do not need to show unreachable states. c. L, UL, d. L nL