What will be the best worth found by the branch and bound backpack Algorithm using a standard queue with a limit of 55 and the objects ([5,20], [10,25] , [15,30] , [20, 70], [30 , 15] , [35, 35], [40,60]? Repeat the problem using a priority queue based on the bound value
