On Codeblocks/C++

1. Implement an Unsorted List ADT using a linked list implementation with an extension of ADT with function SplitLists. Keep the function names the same as in Unsorted List ADT in Chapter 3.

SplitLists function requirements:

SplitLists(UnsortedType list, ItemType item, UnsortedType& list1, UnsortedType& 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 items key; list2 contains all the items of list whose keys are greater than items key

2. Describe and implement the testcases for the functions SplitLists, MakeEmpty, InsertItem, DeleteItem, RetrieveItem, ResetList, GetNextItem based on their Preconditions and Postconditions.