Question $2$

Consider that we have $n=5$ objects with the weight and values given in the table below, and

the knapsack weight is $W=28.$ We solve this Fractional Knapsack Problem using the Greedy

algorithm learned in class.

When the algorithm terminates, all the $x_i$ values $(i=1,2,..,5)$ have value $0$ or $1.$

True

Default

False