Splitting, Sorting, and Merging Linked Lists.

Implement a templated linked list class as described in the following test file:

splitMerge.cpp

Your split, merge, print, loadFromFile, and writeToFile methods must all run in O(n) time. The method push_back must run in O(1) time.

Sort should run in at most O(n^2) time, so you may choose to implement any elementary sorting algorithm of your choice.

The last part of this assignment involves the following file:

whale.txt