Translate the following inference to logic notation: For all x, if x_2 makes tea, then x_2 is poor. For all x, if x_2 were poor, then x_2 is a doctor. For all x, if x_2 were a doctor, then x_2 is making tea. Therefore for all x, if x_2 were a doctor, then x_2 is making tea.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: R(x) -> P(x). Therefore forall x: R(x) -> P(x).