Suppose you have a procedure which runs in polynomial time and tells you whether or not a SAT3 problem is feasible. Show that you can use it to develop a polynomial-time algorithm for SAT3 (which returns a feasible assignment, if it exists).