Assignment 1 Update for Resubmission

Assignment 1 feedback is as follows:

The specs say that the first list has size floor (n/2).
The initial list has size 7. For the first subproblem,
you should have a sub-list of size 3 but instead you have 4

MARKS: -5 taken off: Your concatenation operation in reverse takes O(n) time.
We can concatenate two lists together in O(1) time.

MARKS: -5 taken off: Your code is overly complicated.
Don't include the problems of size 2 in the base case.
It just makes it harder to test exhaustively, more conceptual
overhead for someone reading the code, and one more place
where something might go wrong.
The transfer idea is more complicated then what you need to
be doing to accomplish this task.
Once you have a pointer to what will be the last cell on list1,
it only takes a few more statements to get the two new lists
ready to go.

Issues have been addressed/corrected.