15. (8 points) Each of the following diagrams presents an attempt at a binary search tree as discussed in class, but not all of them are correct. For each diagram, mark Correct if it is a correct binary search tree and Wrong if it is not. Then, if you marked Wrong, explain in the space below how it violates the definition of a binary search tree. Correct Wrong If it is wrong, why? Correct Wrong If it is wrong, why? Correct Wrong If it is wrong, why? Correct Wrong If it is wrong, why? 15 13. (4 points) The tree pictured to the right is a heap of integers. In the space below draw the heap that would result from removing the smallest item, using the algorithm discussed in class. (To receive partial credit you must show your work) 28 42 31