Translate the following inference to logic notation: For all x, x_10 will make tea. For all x, if x_10 plays tennis, then x_10 is making tea. For all x, if x_10 makes tea, then x_10 is playing tennis. Therefore Jennifer is playing tennis.
forall x: P(x). forall x: Q(x) -> P(x). forall x: P(x) -> Q(x). Therefore Q(a).