$(20$ points$)$ Greedy Algorithm: Use greedy algorithm to solve the fractional knapsack problem.

Given the six items in the table below and a knapsack with a weight limit $1001.$ value that can be carried with the knapsack? In onder to obtain the maximum value, which items $[$or what fraction of them if some items need to be broken into pieces$)$ should you put into the knapsack?

$\backslash$table$[[$Item $[$D$,$Weight $($LB$),$Value $($$$),$Value $/$ Weight $($$$/$LB$),$Weight $($LB$)$ taken,Value $($$$)$ taken$],[$A$,100,40,0\mathrm{.}4,,],[$B$,50,35,0\mathrm{.}7,,],[$C$,40,20,0\mathrm{.}5,,],[$D$,20,4,0\mathrm{.}2,,],[$E$,10,10,1\mathrm{.}0,,],[$F$,10,6,0\mathrm{.}6,,],[$Total$,230,115,\frac{\frac{?}{?}}{\frac{?}{?}}\frac{\frac{?}{?}}{\frac{?}{?}}\frac{\frac{?}{?}}{\frac{?}{?}}\frac{\frac{?}{?}}{\frac{?}{?}}\frac{?}{?},,]]$