Worst case of searching in a b-tree

Question

Q1. Consider five items all along with their respective weights and values:

I = 1, I₂, I₃, I₄, I₅>

w = <5, 10, 20, 30, 40>

v = <30, 20, 100, 90, 160>

The capacity of knapsack W = 60. Determine the solution to the fractional knapsack problem.

Q2. Write down an algorithm to search a key in a B-tree. Illustrate the worst case of searching in a B-tree? List all the possible conditions which can take place while inserting a key in a B-tree?