Write a the fastest 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 par$-$tial assignment by applying unit propagation before branching on the two truth assignmentsfor a given variable $($this is the famous DPLL algorithm but without pure literal elimination$).$ Incase the clause set is satisfiable under the partial assignment it should output a full satisfyingassignment; 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. Your code should run at least $0\mathrm{.}08$ seconds for large inputs