✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Consider the 0/1 Knapsack Problem with knapsack capacity m=15. The four items having weights as (w )=(2,4,6,9) and profits (p )=(10,10,12,18). The lower bound c and upper bound u of an intermediate node in one of the step solving the 0/1 Knapsack Problem using LC Branch and Bound are -38 and -38 respectively. The lower bound c and upper bound u of next level of nodes in State Space Tree are