Translate the following inference to logic notation: For all x, if x_2 makes tea, then x_2 is working. For all x, if x_2 works, then x_2 is sleeping. For all x, x_2 will sleep if and only if x_2 is curious. Therefore for all x, if x_2 makes tea, then x_2 is curious.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: R(x) <-> S(x). Therefore forall x: P(x) -> S(x).