Given the following items with sizes in list L, and a constant bin size of 12: L = [4 11 10 7 2 5 9 5 6 8 10 8 4 9 1. What is the lower and upper bounds on the number of bins needed? 2. Implement the Next Fit, First Fit, and Worst Fit Heuristics. 3. Do you expect the number of bins to increase or decrease if you use the First Fit Decreasing Heuristic? Why? Given the following items with sizes in list L, and a constant bin size of 12: L = [4 11 10 7 2 5 9 5 6 8 10 8 4 9 1. What is the lower and upper bounds on the number of bins needed? 2. Implement the Next Fit, First Fit, and Worst Fit Heuristics. 3. Do you expect the number of bins to increase or decrease if you use the First Fit Decreasing Heuristic? Why