Prove the following argument. Make sure you write the rule$/$law you applied at each step.

$not{p}^{{?}^{?}}q$

$rp$

notr$s$

$st$

:$.t$

$-p^q,$ Hypothesis

r $->$ p$,$ Hypothesis

$-$r $->$ s$,$ Hypothesis

s $->$ t$,$ Hypothesis

$-$p$,$ Simplification, $1$

$-r,$ Modus Tollens,$2,5$

s$,$ Modus Ponens,$3,6$

t$,$ Modus Ponens,$4,7$

Type your answer in the answer box.

Important: Type $\text{'}$v$\text{'}$ for logical or$,\text{'}^\text{'}$ for logical and, $\text{'}-\text{'}$ for logical not, $\text{'}->\text{'}$ for implication, for biconditional. Upon completion, ask a TA or the instructor to check your solution off. If you

complete after class, we will grade it later.

I received a $0\%$ on this need help fixing$/$getting correct answer.

This is Computer Science Logic and Algorithms class.