Write a efficient recursive Python function cdcl sat solve that takes two arguments clause set and partial assignment as input and solves the satisfiability of the clause set under the partial assignment. In case 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