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