Suppose we have access to an oracle, who can answer the decision problem SAT. Show that, by asking a polynomial number of questions, we can find a satisfying assignment if one exists.

Hint: first describe how setting a variable gives a smaller SAT formula on the remaining variables. Show that this is true of Subset Sum as well. This property is called self-reducibility.