Consider a B-tree of order 3 in which the values 71 are inserted in decreasing order. Show how the B-tree grows. What is the greatest number of comparisons needed for a successful search in this B-tree? What is the average number? Suppose the same values are inserted in the same order into a binary search tree. What is the greatest and average number of comparisons needed to search this data structure? [9 marks]