Linked List Problems

10void GetNthTest() {List myList = BuildOneTwoThree(); // build {1, 2, 3}int lastNode = GetNth(myList, Length(myList)-1); // returns the value 3}Essentially, GetNth() tries to make the list appear like an array — the client can ask forelements by index number. However, GetNth() is much slower than [ ] for an array. Theadvantage of the linked list is its much more flexible memory management — we canPush() at any time to add more elements and the memory is allocated as needed.// Given a list and an index, return the data// in the nth node of the list. The nodes are numbered from 0.// Assert fails if the index is invalid (outside 0..lengh-1).int GetNth(struct node* head, int index) {// Your code3 — DeleteList()Write a function DeleteList() that takes a list, deallocates all of its memory and sets itshead pointer to NULL (the empty list).void DeleteListTest() {List myList = BuildOneTwoThree(); // build {1, 2, 3}}DeleteList(&myList); // deletes the three nodes and sets myList to NULLPost DeleteList() Memory DrawingHere's the drawing showing the state of memory after DeleteList() executes in the abovesample. Overwritten pointers are shown in gray and deallocated heap memory has an 'X'through it. Essentially DeleteList() just needs to call free() once for each node and set thehead pointer to NULL.StackHeapDeleteListTest()myListmyList isoverwrittenwith thevalue NULL.1 2 3The three heap blocks are deallocated by calls tofree(). Their memory will appear to be intact fora while, but the memory should not beaccessed.