(b) Show the result of inserting 12, 4, 15, 20, 18, 8 in the order they are listed, into: (0) an initially empty binary search tree, [10%) an initially empty binary heap. [10% In cach case, provide a breakdown of the insertion process by drawing the data structure after each value is inserted