Consider the propositional logic formula:

$(PvvQ{)}^{{?}^{?}}(notPvvQvvR{)}^{{?}^{?}}(notQvvR{)}^{{?}^{?}}(notR{)}^{{?}^{?}}(SvvT{)}^{{?}^{?}}(notSvvnotT)$

For this formula, use the Davis$-$Putnam$-$Logemann$-$Loveland $($DPLL$)$ algorithm to check

for its satisfiability. Justify each step of your answer. If satisfiable, provide an assignment

to $P,Q,$ and $R$ that makes the formula "True." If not, show where the DPLL algorithm

aborts.