Suppose that you are given a black box that magically solves SAT(formula satisfiability problem) in constant time. That is given a boolean formula of variables and logic operators, the black box tells you, in constant time, whether or not the formula can be satisfied. Using this black box design and analyze a polynomial-time algorithm that computes an assignment to the variables that satisfies the formula.