Translate the following inference to logic notation: For all x, x_9 is a politician if and only if x_9 will drive a car. There is at least one x for which if x_9 were a politician, then x_9 is playing a game. For all x, if x_9 plays a game, then x_9 is making tea. Therefore there is at least one x for which if x_9 drives a car, then x_9 is making tea.
forall x: P(x) <-> Q(x). exists x: P(x) -> R(x). forall x: R(x) -> S(x). Therefore exists x: Q(x) -> S(x).