For each pair, determine the logical relation between the left and right formulas (implies, contradicts, or independent):

\[\begin{gather} \forall x.\con{p}x\rightarrow \con{q}x& \exists x.\con{p}x\\ \forall x.\con{p}x\rightarrow \con{q}x& \exists x.\con{q}x\\ \exists x.\con{p}x\wedge \con{q}x& \exists x.\con{p}x\\ \forall x.\con{p}x &\exists x.\con{p}x\\ \neg\exists x\,\con{r}x& \forall x.\neg\con{r}x\\ \forall x.\con{p}x\land\con{r}x& \forall x.\con{p}x\rightarrow \con{r}x\\ \forall x.\con{p}x\land\con{r}x& \forall x.\con{p}x :\land. \forall x.\con{r}x\\ \forall x.\con{p}x\lor\con{r}x& \forall x.\con{p}x :\lor. \forall x.\con{r}x\\ \exists x.\con{p}x\land\con{r}x& \exists x.\con{p}x :\land. \exists x.\con{r}x\\ \exists x.\con{p}x\lor\con{r}x& \exists x.\con{p}x :\lor. \exists x.\con{r}x\\ \end{gather}\]