Q7: If you want to mimic random access of values in a linked list that is equivalent to the 0(1) operator [k] for vectors, you can do this at cost O(1) with a list iterator itr and code fragment tr = mylist.begin ( ); itr- tr + k; *?tr; (a) This statement is true. (b) This statement is false. Q8: List iterators allow for the step-by-step traversal of a doubly linked list data structure. Given the declaration of a list iterator such as Listprev->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