9. (12 points) Draw the binary minimum heap that results from inserting 11. 9, 12, 14, 3, 19, 7, 8, 2 in that order into an initially empty binary heap. You are required to show the final tree, as well as intermediate trees after the 4th (we insert 14) and 6th insertion (we insert 19)