Instructions:

Draw and cut the tree which represents the implications given below.
If a cycle can be formed, eg, (A->B)∧(B->C)∧(C->A)
Then it will combined into one single node. This is because all of the literals must be equal to one another.
Remember: If you are unsure about the full controls, go back and practice with the tutorials.

Objective:
• Draw the implication graph with nodes and links.
• Cut the graph produced, showing you the number of valid evaluations.