For the given items below where the capacity is given as 1 , apply next-fit , first-fit, best-fit, first-fit decreasing, best-fit decreasing algorithms .how many bins are required by each of these algorithms? what is the optimal solution? items are{ 0.5,0.6,0.8,0.2,0.1,0.5,0.4,0.2,0.3}