Q$\mathrm{.}2/$ Explain how the Subset Sum Problem $($SSP$)$ can be reduced to the Knapsack Problem $($KP$).$

Clearly describe the transformation of elements between the two problems and explain how solving one can help solve the other.

Grow it scientifically

Subset Sum Problem Recap: In the Subset Sum problem, given a set of integers and a target sum SSS$,$ we are tasked with determining whether a subset of the integers exists that sums up to SSS$.$

Knapsack Problem Recap: In the Knapsack problem, we are given a set of items, each with a weight and a value, and a maximum weight capacity. The goal is to select items such that their total weight doesn't exceed the capacity, and their total value is maximized.

problem.