Translate the following inference to logic notation: For all x, if x_8 were a nurse, then x_8 is curious. For all x, x_8 is curious. There is at least one x for which if x_8 were curious, then x_8 is making tea. For all x, if x_8 makes tea, then x_8 is a nurse. Therefore there is at least one x for which x_8 will make tea.
forall x: P(x) -> Q(x). forall x: Q(x). exists x: Q(x) -> R(x). forall x: R(x) -> P(x). Therefore exists x: R(x).