Translate the following inference to logic notation: For all x, if x works, then x is a janitor. For all x, if x were a janitor, then x is working. For all x, if x were a janitor, then x is working. Therefore if Karen works, then Karen is a janitor.
forall x: P(x) -> Q(x). forall x: Q(x) -> P(x). forall x: Q(x) -> P(x). Therefore P(a) -> Q(a).