Translate the following inference to logic notation: For all x, if z_4 makes tea, then z_4 is excited. For all x, z_4 will make tea or z_4 is not excited. Therefore if Susan makes tea, then Susan is excited.
forall x: P(x) -> Q(x). forall x: P(x) or ~Q(x). Therefore P(a) -> Q(a).