1. In the context of data structures, why would using a language with templates be advantageous? 2. What is the difference between a vector's size and capacity? How do these properties influence the insert operation? 3. Suppose I wanted to implement a sequence container by using an linked list. What would be the complexity in terms of Big-O for the following operations: o Locate an element based on index o Insert an element in the front o Insert an element in the back 4. Describe one operation where a doubly linked list would affect the complexity of that operations as compared to a more "generic" singly linked list