1. Convert single linked list to be a doubly linked list.

2. Read the UProducts.csv file and create ADT's to store the data in the doubly linked list.

3. Use either the Bubble, Selection or Merge sort to sort your doubly linked list. Note: it is easier to swap data in a node rather than to swap the "addresses" of two nodes.

4. Write a recursive algorithm to traverse your doubly linked list forwards and backwards.

5. The interface for the Doubly Linked List should be the same as the Singly Linked list.