Given the following knowledge in predicate logic, transform each sentence to the form normal conjunctiva to obtain an equivalent set of clauses.

Number the clauses with the number of sentences that produce them. If a sentence produced more than a clause, use letters of the alphabet to complete your numbers. For example, if sentence $1$ produces two clauses, the first should be numbered $1$A$,$ while the second should be numbered $1$B$.$

$1$: $$x $\{$P$($x$)->$ Q$($x$,$ M$1)\}$

$2$: $$x $$y $\{[$R$($x$,$ y$)$z S$($x$,$ z$)]->$Q$($x$,$ y$)\}$

$3$: R$($M$1,$ M$2)$ S$($M$3,$ M$2)$

$4$: $$x $$y $\{[$P$($x$)\{$z $[$Q$($z$)$ V$($x$,$ z$)]\}]->$ W$($x$,$ y$)\}$

$5$: $$x $\{[\{$y $[$V$($x$,$ y$)$ P$($y$)]\}->$z V$($x$,$ z$)]$y W$($x$,$ y$)\}$

$3.$ Using the clauses from the previous problem, use the solution to try to prove by

refutation that:

$$x $$Q$($x$,$ M$1)$

Number the query clauses and each new clause produced by the resolution steps starting with the number that follows the last number in the previous problem.