May you optmise my code using advance tecniques like pure elimination and advance heuristic branch: My code: def unit$\_$propagation$($clauses$,$ assignment$)$: unit$\_$ clauses for $c$ in clauses if len $(c)=1$ while unit$\_$ clauses: unit $=$ unit$\_$clauses.pop$()$ literal $=$ next$($iter$($ unit$))$ value $=$ literal $>0$ assignment$[$abs$($literal$)]=$ value # Update clauses according to the new assignment updated$\_$clauses $=$ update$\_$clauses$($clauses $,$ literal$)$ if updated$\_$clauses is False: # Handle contradiction return False, assignment clauses $=$ updated$\_$clauses # Find new unit clauses after the update unit$\_$clauses for $c$ in clauses if len$(c)==1]$ return clauses, assignment def update$\_$clauses $($clauses$,$ literal$)$: $""\text{'}$ Update the clauses based on the latest assignment. Parameters: $-$ clauses: the current set of clauses. $-$ literal: the literal that has just been assigned a truth value. Returns: $-$ The updated set of clauses after considering the assignment, or $-$ False if a contradiction is found $($an empty clause$)."""$ updated$\_$ clauses $=[]$ for clause in clauses: if literal in clause: # If the clause contains the literal, it is satisfied continue # So$,$ we skip adding this clause to the updated list new$\_$ clause for $x$ in clause if $x-$ literal