Translate the following inference to logic notation: For all x, y_3 will make tea. For all x, y_3 will listen to a song. Therefore there is at least one x for which y_3 will listen to a song and y_3 will make tea.
forall x: P(x). forall x: Q(x). Therefore exists x: Q(x) and P(x).