If we are being technical (and I must assume that we are given that you are making a technical critique), then everything you are claiming is wrong. 1. The phr

If we are being technical (and I must assume that we are given that you are making a technical critique), then everything you are claiming is wrong. 1. The phrase “an NP Hard problem” refers to the computational complexity of a problem as the “scale” of the problem goes to infinity. Typically, an author would detail the problem, and what parameters go to infinity, but in this case the general problem “The subset sum problem (SSP)” is well known so explaining details is not necessary. 2. The homework question has two parts. The second part asks “(assume a solution exists) is the solution unique?” Clearly this decision problem reduces to SSP and is NP Hard