In the bin packing problem, we are asked to pack a list of items

In the bin packing problem, we are asked to pack a list of items $$L$$ to the minimum number of bins of capacity 1. For the instance $$L$$, let $$FF(L)$$ denote the number of bins used by the algorithm **First Fit**. The instance $$L'$$ is derived from $$L$$ by deleting one item from $$L$$. Then $$FF(L')$$ is at most of $$FF(L)$$. ~@[](2)

答案：FALSE