Translate the following inference to logic notation: For all x, if x were a server, then x is playing tennis. There is at least one x for which if x plays tennis, then x is a writer. For all x, if x were a writer, then x is a server. Therefore there is at least one x for which if x were a writer, then x is playing tennis.
forall x: P(x) -> Q(x). exists x: Q(x) -> R(x). forall x: R(x) -> P(x). Therefore exists x: R(x) -> Q(x).