1. (8 pts) Consider the greedy algorithm for the bin-packing problem, which is called the best-fit algorithm: place each item into the bin that is the best fit, that is, the bin that has the least capacity remaining (but still has enough room to fit the weight). If it does not fit in any bin, then start a new bin. Apply best-fit algorithm to the instance: s1 = 0.4, S2 = 0.7, s3 = 0.2, 54 = 0.1, s5 = 0.5, capacity = 1. En uygun algoritma olarak adlandrlan kutu paketleme problemi iin agzl algoritmay dnn: her bir eyi en uygun olan, yani en az kapasiteye sahip olan (ancak arl sdrmak iin yeterli alana sahip) kutuya yerletirin. Herhangi bir kutuya smyorsa, yeni bir kutu an