Q$6-20$ pts$)$ Given the following items, their weights and values, compute the maximum value of the

items that could be accumulated in a knapsack of weight $W=6lb($also listed in the table$).$ Compute your

solutions as:

$($i$)$ Fractional Knapsack problem: Greedy strategy

$($ii$)$ Integer $(0-1)$ Knapsack problem $(W=6lb)$: Dynamic Programming

$($iii$)$ Using the result of $($ii$),$ determine the total maximum value and the corresponding items that

can be picked if the Knapsack weight is reduced to $5lb.$

Show all the work $($including the value and history tables for the Integer Knapsack problem$)($using no programing code$)$