Quickcheck

This homework assignment is composed of two problems. All team members should work on both parts.

Make all of your edits in the files Sat.hs and AVL.hs.

Problem - A SAT solver

This problem gives you more experience with quickcheck. You might want to review the QuickCheck lecture notes before you begin.

This problem is based on balanced binary search trees. You might want to review the RedBlack lecture notes before you begin.