Use the "cross-product" technique to build a DFA over sigma = {a, b} L = {x | there is at most one a in x wedge there is at least one b in x} (define the quintaplet and draw the transition diagram). Find the automaton that accepts only the strings rejected by the F.A. in (a) above. Prove/justify your