Transcription: This class demonstrates overloading the New and Delete operators. New and Delete manage a cache. The use of a cache reduces the overhead associated with FreeStore allocation. The cache is an array of cached nodes. The next pointer in each element of the array points to the adjacent array element, forming a linked list. The linked list is called a free list. When a cached node is allocated from the cache, it is removed from the free list. When the free list is empty, cached nodes are allocated from FreeStore using colon colon new.