6. [18 marks) Given the values: 20, 15, 5, 10, 30, 25, 35 a) Show the result of inserting the values above to a B -Tree with order 3 and the leaf nodes can store up to 3 records. (hints: at most two values in an internal node) (6 marks) b) Show the result of inserting the values above to a max-Heap. (6 marks) c) Assume n records are stored, what is the Big-O of searching a value in max-Heap? (2 marks) d) Discuss one advantage and one disadvantage of max-heap compared with Binary Search Tree. (4 marks)