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 6(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 As a function of its radius n, the area of a circles grows as As a function of its diameter n, the area of a circle grows as As a function of its number of nodes n, the height of a binary tree grows as, . The MinHeap we implemented was of a fixed size. Imagine that we are going to allocate a new array in MinHeap to accommodate more elements when the existing array is full. Consider the total cost of inserting n items into such a heap whose size is initially 1, with array.length-2. When the array is full it is replaced by an array that is one cell larger than the old array. The cost of inserting n items using this strategyis When the array is full, it is replaced by an array that is twice the size of the old array. The cost of inserting n items using this strategy is The time to perform 10 extractMin() operations in a heap initially of size n, where n 2 10, is o Given a heap of size n, the time to extract half of its elements is . Consider an array such that its elements are already sorted. To find a given element in O(n) time you can use . Consider an existing linked list of n elements without a tail reference. If we add a tail reference to that implementation, the increase in required storage