In this assignment you will create a Doubly-Linked List ADT module, and use it to perform an Insertion Sort. Another goal of this project is to make sure everyone is up to speed with C, especially pointers and structures, and to build an ADT that can be reused in future assignments. Be sure to read the two files ADT.pdf (which discussed ADTs in Java and C) and ADTRemarks.pdf (which has more information about ADTs in C) before proceeding, paying special attention to the second handout. Both files are on Piazza, under Resources General Resources. The executable file for this project will be called InsertSortLinked, and will be operated by doing % ins erts or tLinked

at the command prompt %. The program File 10.c, which is also posted on Resources General Resources, shows one way that file input and output can be accomp lished in C. Your List ADT module will be contained in a file called Liste, whose operations will be used by InsertSortLinked. Your List ADT will be a doubly-linked list of Node objects. The underlying data structure for the list will be a doubly linked list of Node objects. You may use the examples Queue.c and Stack.c (provided on Piazza under ResourcesQueueExample and Resources StackExample) as starting points for your design. Your List module will export a List type along with the follow ing operations. (Some of these operators are not needed for PAl, but you should implement all of them.) Constructors-Destructors- List newList (void)i/7 returns a List which points to a new empty list object void freeList