Draw the tree for the binary min-heap that results from inserting these elements in this order into an initially empty heap: 11, 9, 12, 14, 3, 15, 7, 8, 1

Implement a document scanning function wordcountengine, which receives a string document and returns a list of all unique words in it and their number of occurrences, sorted by the number of occurrences in a descending order. if two or more words have the same count, they should be sorted according to their order in the original sentence. assume that all letters are in english alphabet. you function should be case-insensitive, so for instance, the words “perfect” and “perfect” should be considered the same word.