Match each English sentence to a wffs that represents it. The domain D = "all dogs" B(x) = "x is a beagle" L(x) = "x is a Labrador retriever" P(x) = "x plays well with other dogs" W(x) = "x likes to bark" VX (P(x) - W(x)) 1. There is a dog that likes to play with other dogs but it is not a beagle or a Labrador retriever. 3x (B(x) W(y)') 2. Some beagle doesn't like to bark. vx ((B(x) L(x)) P(x)) 3. All beagles and Labrador retrievers plays well with other dogs. 3x (P(x) ^ (B(x) v L(x))) 4. Every dog that plays well with other dogs also likes to bark