printf("element not found ")delete( )printf("list after deleting an item")printlist()printf("\ ")foundlink find( )if(foundlink !nullprintf("element found")printf("(% ,% ",foundlink->key,foundlink->data)printf("\ ")else printf("element not found ")printf("\ ")sort()printf("list after sorting the data")printlist()reverse(&head)printf("\nlist after reversing the data")printlist()if we compile and run the above programit will produce the following result output original list( , ( , ( , ( , ( , ( , deleted value:( , deleted value:( , deleted value:( , deleted value:( , deleted value:( , deleted value:( , list after deleting all items[restored list( , ( , ( , ( , ( , ( ,