Translate the following inference to logic notation: For all x, x_2 will not drink water. For all x, if x_2 drinks water, then x_2 is making tea. For all x, if x_2 makes tea, then x_2 is cooking. For all x, if x_2 cooks, then x_2 is drinking water. Therefore for all x, x_2 will not make tea.
forall x: ~P(x). forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: R(x) -> P(x). Therefore forall x: ~Q(x).