In the context of First-Order Logic, what is the Prenex Normal Form of (∀xP(x)) ⟹ (∃yQ(y))(\forall x P(x)) \implies (\exists y Q(y))(∀xP(x))⟹(∃yQ(y))?
∃x∃y(P(x) ⟹ Q(y))\exists x \exists y (P(x) \implies Q(y))∃x∃y(P(x)⟹Q(y))
∃x∀y(P(x) ⟹ Q(y))\exists x \forall y (P(x) \implies Q(y))∃x∀y(P(x)⟹Q(y))
∀x∃y(P(x) ⟹ Q(y))\forall x \exists y (P(x) \implies Q(y))∀x∃y(P(x)⟹Q(y))
∀x∀y(P(x) ⟹ Q(y))\forall x \forall y (P(x) \implies Q(y))∀x∀y(P(x)⟹Q(y))