In lecture, we saw that SubseT SUM is in $\mathcal{N} \mathcal{P) $ (we also saw it is $\mathcal{N} \mathcal{P}$-complete, but that isn't the point here). Suppose you had a polynomial-time algorithm (or Turing Machine, however you prefer to think of this) for the decision version of the SUBSET SUM problem. Note that this means the algorithm only outputs "yes" or "no" - and you can't inspect the source code or schematic to see how it works! Just the same, show how you can use this to create a deterministic, polynomial-time algorithm that determines which subset, if any, of the input set adds to the target value. If multiple subsets do, you need only provide one of them. How many calls to the decider does your function make? cs.vs. 1228||