What is NOT an advantage of linked list compared to an array? Inserting at the front of a sorted linked list is faster than a sorted array. No constant size Removing a node is faster than removing an array value (or as fast) Faster searching time Searching a sorted linked list is faster than searching a sorted array. Let's pretend I have a stacks and a queue q. I add elements A, B then C to both. I then remove all three elements. What is the order the elements are removed for s and q? s: A, B, C s: C, B, A s: A, B, C q: A, B, C s: C, C, C q: A, A, A s: C, B, A q: A, B, C q: C, B, A q: C, B, A Given what we know about templates (and the fact the code has to all be in the .h file), what is an issue that is created when using them? (there are multiple correct responses) The .h file is included multiple times and functions locations become ambiguous. They are a pain to write. T is an ambiguous term. The order of the functions and classes matter since there is no separate .h for prototypes There is no way to know what class T requires.