Translate the following inference to logic notation: For all x, if x_11 drives a car, then x_11 is a janitor. There is at least one x for which x_11 will drive a car or x_11 will cook. For all x, if x_11 cooks, then x_11 is a janitor. For all x, x_11 will make tea. Therefore there is at least one x for which x_11 will make tea.
forall x: P(x) -> Q(x). exists x: P(x) or R(x). forall x: R(x) -> Q(x). forall x: S(x). Therefore exists x: S(x).