Write a efficient advance recursive Python function dpll sat solve that takes two arguments clause setand 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 assignmentsfor a given variable 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 runwith an empty partial assignment it should act as a SAT$-$solver. You may use advance sat solve tecniques like pure elimination $.$ Your code should be optimal and fast