A container is an abstract data structure that supports element access through iterators. An iterator abstracts the process of scanning through a collection of elements. begin(); returns an iterator to the first element end(); return an iterator to an imaginary position just after the last element. An iterator behaves like a pointer to an element. *p: returns the element reference by this iterator ++p: advances to the next element. True False