We can formulate the problem in $($b$)$ into a decision problem as follows: given n programs of sizes a$1,$ a$2,...,$ an$,$ with chip capacity L$,$ and integer k$,$ is there a packing of programs onto the chip such that the unused space is k or less. Show that this decision problem is NP$-$complete.