Consider the following sentence in propositional logic: (P VQV-R) A (PV-Q) A-PARAU Use the DPLL algorithm, with pure literal rule as long as pure literal exists, otherwise, use one literal rule, to find a satisfiable assignment or to show that such assignment is inexistent. B 1 U S X2 X2 mil Va 12 TX Assignment Set Propositional Logic Sentence DPLL Rule (PVQV-R) ^ (Pv-Q) A-PARAU