Write a recursive Python function dpll sat solve faster than mine that takes two arguments clause set and partial assignment as input and solves the satisfiability of the clause set under the partial assignment by applying unit propagation before branching on the two truth assignments for a given variable $($this is the famous DPLL algorithm but without pure literal elimination$).$ In case the clause set is satisfiable under the partial assignment it should output a full satisfying assignment; if it is not satisfiable the function should return False. When the function is run with an empty partial assignment it should act as a SAT$-$solver. For the $8$ queens problem my code take $0\mathrm{.}08$ seconds.