Suppose that you have the following elements 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20. a) Draw the binary search tree (BST) for the above elements. b) Draw the B-tree for the above elements when the order m = 4, 5, 6. c) How many access times to find the element 20 for each tree?

Suppose that you have the following elements 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15, 16,17,18,19,20. a) Draw the binary search tree (BST) for the above elements. b) Draw the B-tree for the above elements when the order m=4,5,6. c) How many access times to find the element 20 for each tree