2. (30pts) A compound proposition is satisfiable if there is an assignment of truth values to its variables that makes it true. That is, satisfiable if there is at least one TRUE in the truth table. In C++ Write a program that checks whether the following compound proposition is satisfiable and outputs the conclusion: If the compound proposition is satisfiable, find and print out all assignments of truth values for p, q and r that make it true