6. (20 points) Letters for you to use to fill in the blanks: a (1) b (log n) c (n) d (n log n) e (n2) f linear search g binary search For each statement below, fill in the blank with a letter chosen from the above list Correct responses may or may not be unique. . The worst-case time to insert n integers into an initially empty min heap is . Consider a queue implemented as a linked list without a tail reference. Suppose that queue is used for n enqueue operations followed by n dequeue operations. The best implementation can do this in time. Consider a stack implemented as a linked list without a tail reference. Suppose that stack is used for n push operations followed by n pop operations. The best implementation can do this in The time to perform n extractMin() operations in a heap initially of size n is