Draw the binary min heap that results from inserting 10,12,1,14,6,5,8,15,3,9,7,4,11,13,2 in that order into an initially empty binary heap you do not need to show the array representation of the heap you are required to show the immidiate trees although if you draw intermediate trees. Please circle your final result for ANY credit