Translate the following inference to logic notation: There is at least one x for which x_5 is not poor. For all x, x_5 is poor or x_5 will make tea. Therefore there is at least one x for which x_5 will make tea or x_5 will play tennis.
exists x: ~P(x). forall x: P(x) or Q(x). Therefore exists x: Q(x) or R(x).