1. How many steps does it take to delete an item from a binary search tree (BST)? (When in doubt, always assume worst-case.) c) O(n) d) O(n log n) e) O(n2) b) O(log n) 2. How many steps does it take to build a heap using the bottom up method. 3. How many steps does it take to perform an extract-min from a min-ordered heap? 4. How many steps does it take to perform an enqueue operation on a queue implemented as a linked list? 5. The worst-case to insert an item into a Hash table takes how many steps? 6. The goal of hashing is for inserts to take how many steps on average? 7. Heapsort (using a Heap to sort) n elements takes how many steps