lated class SortedList was extended by adding a new member function MergeLists the prototype of which is given below with respective precondition and postcondition // File SortedList.h: Header file for Sorted List ADT //Class is templated. template sclass ItemType> struct Node Type template class SortedList public SortedList(O: // Class constructor -SortedList) Class destructor bool isFull) const int lengthis 0 const void make Empty) void retrieveltem(ltem Typed item, boold found: void insertitem(ItemType item) void deleteltem(ItemType item); void resetListO void getNextltem(ltemTyped): IPrecondition: the current object and object list are sorted. Assume they have different elements Postcondition: result is a sorted list that contains all elements of the current object and object list void mergeLists(SortedList& list, SortedList-ItemType>& result) private: Node Type *listData int length Node TypecltemType> currentPos #include "SortedList cpp" //Implementation file for Sorted List ADT. /l Class is templated. template struct Node Type ItemType info: Node Type next