a. Consider 5 items along with their respective weights and values I = w =

a. Consider 5 items along with their respective weights and values I = w = v = The capacity of knapsack W = 60. Find the solution to the fractional knapsack problem. (9) b. Write an algorithm to search a key in a B-tree. What is the worst case of searching in a B-tree? List the possible situations that can occur while inserting a key in a B-tree?</i1,>