The objective of resolution refutation is to prove that the set of clauses is unsatifiable

Please complete this in python.

In this lab you will be implementing resolution for propositional logic. At this point, consider this lab's task an exercise in algorithm implementation. Coming up, we will use resolution "refutation" for the purpose of theorem proving by contradiction. Create and edit your own file resolve lab7.py The input data structure should be the following list: Each sublist is a list of literals and the sublist itself is called a clause. Literals can be positive or negative; negative literals are prefixed with 'not'. Two literals are complements when one is positive and the other is negative, forexample: 'notP'and'P'. In this lab you will be implementing resolution for propositional logic. At this point, consider this lab's task an exercise in algorithm implementation. Coming up, we will use resolution "refutation" for the purpose of theorem proving by contradiction. Create and edit your own file resolve lab7.py The input data structure should be the following list: Each sublist is a list of literals and the sublist itself is called a clause. Literals can be positive or negative; negative literals are prefixed with 'not'. Two literals are complements when one is positive and the other is negative, forexample: 'notP'and'P