the problen instance of exercise 1 is:

4. Use Algorithm 6.2 (The Best-First Search with Branch-and-Bound Prun- ing algorithm for the 0-1 Knapsack problem) to maximize the profit for the problem instance of Exercise 1. Show the actions step by step. cstep by step i Pi wi 1 $20 2 10 2 $30 5 6 3 $35 7 5 4 $12 3 4 5 $3 1 3 Wi W 13