Translate the following inference to logic notation: For all x, x_11 is a nurse. For all x, x_11 will not make tea. There is at least one x for which if x_11 were a nurse, then x_11 is driving a car. For all x, x_11 will make tea or x_11 will work. Therefore there is at least one x for which x_11 will drive a car and x_11 will work.
forall x: P(x). forall x: ~Q(x). exists x: P(x) -> R(x). forall x: Q(x) or S(x). Therefore exists x: R(x) and S(x).