Q16: Imagine a queue data structure implemented as queueenqueue (T) calls a function list push_backt). implemented in terms of which list function? hented as an adapter of a linked list, and function back(). Then the front() function for queue is best (a) (b) List::begin() List::end() List:: front() List::back) Q17: Person A proudly shows off an implement push, pop and top. Person B comments that this benefit from the addition of an iterator. A's best response in implementation of a stack class with member functions size, empty, ments that this is a nice start, but that the stack structure would greatly best response to B's suggestion is which? (a) Agree. (b) Disagree. Q18. The following code fragment computes the maximal line contains an error? nent computes the maximal value stored in a linked list of integers. Which WN List::iterator itr = mylst.begin(); int max = *itr; for (itr = mylst.begin(); itr != mylst.end(); ++itr) if (itr > max) max = *itr; 00 O cout