判断题：For the 0-1 version of the Knapsack problem, if we are greedy on

For the 0-1 version of the Knapsack problem, if we are greedy on taking the maximum profit or profit density, then the resulting profit must be bounded below by the optimal solution minus the maximum profit.

答案：TRUE