Proficiency Assignment: More Logical Circuits Topic: NP-Completeness. In class, we discussed the known NP-Complete problem called Circuit-SAT. In that problem, you are given a set of inputs (some fixed, some you can determine) and a "circuit" of binary AND, binary OR, and unary NOT operators ending with a single sink. The question asked is then: Is there an assignment on the unfixed inputs such that the circuit evaluates to TRUE? Consider a related "version" of a circuit-satisfiability problem, In our new variant, you are given integer inputs (some fixed, some you can determine) and a "circuit" consisting of operators for binary addition, subtraction, multiplication, and division. You are asked: Given a circuit and a target number, is there an assignment on the unfixed inputs such that the circuit evaluates to the target number? Show that this Math-Circuit-SAT problem is NP.Complete. As a reminder, you will need to show that Math-Circuit-SAT is in NP, and that some known NP.Complete problem can be reduced to it.