Recall the DFA described in class (here we'll call it B) that accepts a binary string iff the string ends with 1: Recall the product construction from class. Draw the diagram for the product of A (fronm Problem 5 above) and B so the resulting DFA recognizes the language L(A) n L(B). Recall the DFA described in class (here we'll call it B) that accepts a binary string iff the string ends with 1: Recall the product construction from class. Draw the diagram for the product of A (fronm Problem 5 above) and B so the resulting DFA recognizes the language L(A) n L(B)