3. Find the avcrage runtime complexity of binary search procedure binary search (x: integer, aa., a: increasing integers) i1 i is the left endpoint of interval) j := n U is right endpoint of interval) while i am then i := m + 1 else] := m if x = a, then location : else location : return location = 1 4. Greedy strategy a. Docs using the greedy algorithm for making changc of n cents givc a correct solution if a nickel was worth 6 cents instead of 5? (we have 1, 6, 10 and 25 cent coin denominations) b. We have n unique items. For i 1,2,3. .n, each item has a weight w,>0 and value v,> 0. Write a greedy algorithm to find the maximum value of items that can be carried ina knapsack with a maximum weight capacity ofW. An item may be broken into pieces and only a fraction put into the knapsack. It should take an array of weights, an array of item values and the weight limit of the knapsack as input. The array of weights and items are ordered such that w, corresponds to the same item as v