Assume the set of nodes {3, 7, 10, 12} a) Show all possible min-heaps containing these nodes. Draw each as a tree, and as an array (binary tree in array form). (5 pts) b) For one of your answers in (a), you will perform 4 deletions of the minimum value from the heap. Show the tree form of the heap after each deletion.