A list ADT is to be extended by the addition of the function SplitLists, which has the following specification where ListType is either the class UnsortedType or the class SortedType:
SplitLists(ListType list, ItemType item, ListType& list1, ListType& list2)
Function: Divides list into two lists according to the key of item.
Preconditions: list has been initialized and is not empty.
Postconditions: list1 contains all the items of list whose keys are less than or equal to item's key. list2 contains all the items of list whose keys are greater than item's key.
a.) Implement Splitlists as a memeber function of the Unsorted List ADT.
b.) Implement Splitlists as a client function of the Sorted List ADT.
1. A listing of the specification file (.h) for class **Unsorted** or **Sorted List ADT**
2. A listing of the implemenation file (.cpp)for class**Unsorted** or**Sorted List ADT**
3. A listing of the main driver
4. The *exe*file
5. A screen shot of your ouput
6. Your test plan
7. Simple as possible.
Prefer borland C++