Consider the Knapsack Problem described in the previous question. Data for an instance of this problem is given below. G
Posted: Tue Jul 12, 2022 8:28 am
Consider the Knapsack Problem described in the previousquestion. Data for an instance of this problem is given below. Givean example of how the Greedy Best First Search could be conductedfor this knapsack problem. Illustrate and explain your answer.Suggested answering time 15 minutes.
Item A - B - C - D - E - F - G - H - I - J - K - LSize 5 - 8 - 12 - 3 l - 5 - 8 - 5 - 8 - 12 - 1 - 2 - 3Profit 10 - 20 - 25 - 10 - 20 - 25 - 5 - 15 - 20 - 5 - 15 - 20
Capacity B = 45
Item A - B - C - D - E - F - G - H - I - J - K - LSize 5 - 8 - 12 - 3 l - 5 - 8 - 5 - 8 - 12 - 1 - 2 - 3Profit 10 - 20 - 25 - 10 - 20 - 25 - 5 - 15 - 20 - 5 - 15 - 20
Capacity B = 45