$1.$ A$)$Draw the binary min 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. B$)$ Draw the binary heap that results from doing $2$ deleteMinimum on the heap you created in part A$.$ you are only required to show the final tree although if you draw interimediate trees, please circle your final results.