Solution: There are three sets of requirements. They are container interface requirements, Allocator interface requirements and iterator requirements.

Solution: Allocator interface in the container is required for storage management.

Solution: The basic interface of an allocator class consists of a set of typedefs, a pair of allocation functions, allocate() and deallocate() and a pair of construction/destruction members, construct() and destroy().

Solution: Lookup table means storing values in a table with unique keys for each value so that can be checked in future easily. So for such lookup tables maps are used in C++.

Solution: The container manages the storage space for its elements and provides member functions to access them, either directly or through iterators which reference objects with similar properties to pointers.

Solution: Every container must define an iterator type. Iterators allow algorithms to iterate over the container’s contents.

Solution: The contents of the buffer are initialized using the values from the iterator range supplied to the constructor by the start and finish parameters.

Solution: Vectors are sequence containers representing arrays that can change in size.

Solution: Vectors use contiguous storage locations for their elements, which means that their elements can also be accessed using offsets on regular pointers to its elements

Solution: There are three container properties in c++. They are sequence, Dynamic array and allocator-aware.