Develop an implementation of SAT that is based on a recursive function like Towers Of Hanoi (Program 2.3.2): set the rightmost value in in Subset[] to false and make a recursive call to generate all...

Develop an implementation of SAT that is based on a recursive function like Towers Of Hanoi (Program 2.3.2): set the rightmost value in in Subset[] to false and make a recursive call to generate all possibilities for the remaining values, then set the rightmost value to true and make a recursive call to generate all possibilities for the remaining values (again). The base case is to call check().

Program 2.3.2