Draw the binary mis Heap that results from inserting $11,9,12,14,3,15,7,8,1$ in that order into an initially empty binary heap. You do not need to show the array representation of the heap. You are only required to show the final tree, although if you draw interimediate trees, please circle your final results.