you need to use python$3$ code and resolution method for below information

Satisfiability for $2-$CNF will be your task for

HW # $1.$

$$ The easy version is to check satisfiability

$($using resolution method$).$

$$ The full task is to check satisfiability and, if

the answer is $$yes$,$ to return one of the

satisfying assignments. It is important to keep in mind that the

input is given in human$-$readable form, as

a string representing the formula. Conjunction, disjunction, negation, and

implication, are, resp., $/\backslash ,\backslash /,$ ~$,->.$

$$ Literals: x or ~x$,$ where x is an arbitrary

letter.

$$ Clauses: $(1\backslash /2$

$)$ or $(1->2$

$),$ where

$1$ and $2$ are literals.

$$ The CNF is a conjunction $(/\backslash )$ of clauses. First, one needs to translate the input into

a machine$-$digestable form $($this is called

parsing of the input$).$

$$ Grammar for CNFs:

CNF ::$=$ Clause $|$ CNF $/\backslash$ Clause

Clause ::$=($Lit $\backslash /$ Lit$)|($Lit $->$ Lit$)$

Lit ::$=$ Var $|$ ~Var use python$3$

$$ The program $($in Python$)$ should implement

two functions:

$1.$ is$\_$satisfiable, which takes a CNF and

answers True or False, depending on

whether it is satisfiable.

$2.$ sat$\_$assignment, which takes a CNF and

returns a satisfying assignment as an

associative array:

$\{\text{'}$x$\text{'}$: True, $\text{'}$y$\text{'}$: False, $\text{'}$z$\text{'}$: True $\}$