Prove that if the promise problem is Cook-reducible to a promise
problem that is solvable in polynomial time, then is solvable in polynomial time.
Note that the solver may not halt on inputs that violate the promise.
Guideline: Any polynomial-time algorithm solving any promise problem can be modified such that it halts on all inputs.