Guidelines for reduction problems. A reduction needs to be an accurate description of a polynomial-time process for converting instances of the input problem to instances of the target problem. You can use the examples from the slide deck as a basis for your descriptive level, while keeping to the following guidelines. Reduction descriptions: should be both clear and concise. should be composed of clearly enumerated steps that a well-practiced programmer could follow to construct an implementation. should include an analysis showing that the reduction can be performed in polynomial time. need not include pseudo-code, but pseudo-code may be used if you feel it adds clarity or completeness. Provide a reduction from the Hamiltonian path problem to the traveling salesman problem. Provide a reduction from the clique problem to the independent set