deletions | additions       diff --git a/untitled.tex b/untitled.tex  index fe32b2b..91ae1d0 100644  --- a/untitled.tex  +++ b/untitled.tex 
...
\textsc{binpack} instance and a number $k$, is there a solution  using $k$ or fewer bins? Prove, for fun, that the decision version  is \textsf{NP}-complete.  \item[(b)] Give a very simple algorithm that yields a  $2$-approximation, e.g. it uses at most twice as many bins as the  optimal solution. \end{itemize}