Q8: Regardless of data structure (e. type T) a corresponding iterator Structure (e.g., let Container stand for any data structure that holds values of responding Iterator object is always a pointer to a type T data item. le (a) This statement is true. (b) This statement is false. When comparing the doubly-linked list and vector data structures, the following is true: a Lists and vectors are similar in that they allow access to the front and back values at the same low computational costo (1) (b) Lists and vectors are similar in that they allow equally low cost access and erasing of values at the front and back ends of the structures. (c) Lists and vectors allow equally low cost inserting at the front ends. (d) All of the above statements are false. Q10: Let itr be a list iterator that references an item within a doubly-linked list. The statements (itr.current) ->prev->next = (itr.current) ->next; (itr.current) ->next->prev = (itr.current) ->prev; are lines of code that (a) Play a role in inserting a new value into a linked list at the location of itr. (b) Play a role in erasing a value from the linked list at the location of itr. (c) Play a role in doing a push front () on the linked list. (d) Play a role in traversing a linked list from back to front. Q11: The following function is to remove all values equal to 0 from a vector of integers. void remove_@s (Vector int>& vec) { int * itr = vec.begin(); while ([1]_ -){ if (*itr == 0) vec.erase(itr) (27 return; Blanks [1] and [2] are to be filled with the correct C++ statements. These are (a) itr