Translate the following inference to logic notation: For all x, x_4 will not drive a car. For all x, x_4 will not make tea. For all x, x_4 will make tea or x_4 will drive a car. Therefore for all x, x_4 will play a game.
forall x: ~P(x). forall x: ~Q(x). forall x: Q(x) or P(x). Therefore forall x: R(x).