QUESTION 10 Which of the following is not useful for estimating the growth of resource use? The best case for any algorithm is 1. That will always be the fastest. Best case, which is defined for the input of size n that is cheapest among all inputs of size n. goestimates, which refer to a growth rate as n grows to infinity "Hg Omega" estimates, which are close relatives of "Big Oh* estimates, but they represents a lower bounds. QUESTION 11 Name a very simple fixed-size data type that contains multiple elements which can be referenced by an index Huffman Codes Heap Array Linked list QUESTION 12 Which is NOT an advatage of a Linked List? Linked lists can quickly provide access to nodes by use of an index. Linked lists are extensible. Linked lists don't allocate memory they aren't using You can reference the entire list with just the head pointer. Click Save and Submit to save and submit. Click Save All Answers to save all answers