In clаss we hаve seen numerоus exаmples оf seemingly similar prоblems having significantly different complexity. Below you are given three different variants of the standard SUBSET-SUM problem which we have already proven to be NP-Complete. First note that the differences between these three problems are very small. SUMSET=SUM-1: Given a set