a14: A Queue data structure can be implemented by adapting either a vector or a linked list data structure. Regardless of choice, vector or linked list, the operations of the queue data structure ar1 (a) This statement is true. (b) This statement is false. 015: A stack data structure can be implemented as an adapter of a vector. When this is done, stack data structure should implement function stack: : front ) (c) vector: :end ) (d) vectoreT: :begin) 016: When queue data structure is implemented as an adapter of a linked list and function queuecT ::push(T) calls a function list: :begin (b) list: : end) (c) list: :front ) (d) None of the above 017: Person A proudly shows off an implementation of a stack class with member functions size, empty, push, pop and top. Person B comments that this is a nice start, but that the stack structure would greatly benefit from the addition of an iterator. A's best response to B's suggestion is which? (a) Disagree with B pointing out that an iterator would render the stack class pointless. (b) Agree with B because more functionality is always better