C++ Data Structures (ADT Unsorted Lists)

Here is the exercise from a C++ data structures book that I need some guidance with. Exercise 1 has three parts. (a,b & c) Exercise 1. An Unsorted Type ADT is to be extended by the addition of the function SplitLists, which has the following specifications. 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 an array based member function of the Unsorted List ADT. b. Implement SplitLists as a linked member function of the Sorted List ADT. c. Implement SplitLists as a client function of the Unsorted List ADT.