[Solved]Bin Packing 3 Optimization Problem Ask 1 Elements Array 2 Size K First Bin Assume Size Oft Q37136373

please help with this thank you
Bin Packing-3 The optimization problem: Ask 1. the elements of the array 2. the size K of the first bin and Assume the size ofthe array to be less than 20, Give the answer of minimum number of bins. Give the contents of each bin. Condition: each successive bin will have the size with one less than the previous bin. (Hint: There may be a case when there is no possible number of bins which satisfies the solution. Then the output must mention so.) In the comments, write algorithm. Then write the C program which will be compiled. Then have a screen shot of the execution. Zip both files and upload. Write your name at the top in the comments section Bin Packing 4 The optimization problem : Ask 1. the elements of the array 2. the size K of the first bin and Assume the size ofthe array to be less than 20, Give the answer of minimum number of bins. Give the contents of each bin. Condition: each successive bin will have the size with one more than the previous bin. (Hint: There may be cases when there will be bins which will be empty but must also be considered and counted. Then the output must mention so.) In the comments, write algorithm. Then write the C program which will be compiled. Then have a screen shot of the execution. Zip both files and upload. Write your name at the top in the comments section. Show transcribed image text Bin Packing-3 The optimization problem: Ask 1. the elements of the array 2. the size K of the first bin and Assume the size ofthe array to be less than 20, Give the answer of minimum number of bins. Give the contents of each bin. Condition: each successive bin will have the size with one less than the previous bin. (Hint: There may be a case when there is no possible number of bins which satisfies the solution. Then the output must mention so.) In the comments, write algorithm. Then write the C program which will be compiled. Then have a screen shot of the execution. Zip both files and upload. Write your name at the top in the comments section Bin Packing 4 The optimization problem : Ask 1. the elements of the array 2. the size K of the first bin and Assume the size ofthe array to be less than 20, Give the answer of minimum number of bins. Give the contents of each bin. Condition: each successive bin will have the size with one more than the previous bin. (Hint: There may be cases when there will be bins which will be empty but must also be considered and counted. Then the output must mention so.) In the comments, write algorithm. Then write the C program which will be compiled. Then have a screen shot of the execution. Zip both files and upload. Write your name at the top in the comments section.

Expert Answer

---

Answer to Bin Packing-3 The optimization problem: Ask 1. the elements of the array 2. the size K of the first bin and Assume the s… . . .