data structures using printf("\ delete node from the end")printf("\ delete given node")printf("\ delete node after given node")printf("\ delete the entire list")printf("\ sort the list")printf("\ exit")printf("\ \ enter your option ")scanf("% "&option)switch(optioncase start create_ll(start)printf("\ linked list created")breakcase start display(start)breakcase start insert_beg(start)breakcase start insert_end(start)breakcase start insert_before(start)breakcase start insert_after(start)breakcase start delete_beg(start)breakcase start delete_end(start)breakcase start delete_node(start)breakcase start delete_after(start)breakcase start delete_list(start)printf("\ linked list deleted")breakcase start sort_list(start)break}while(option != )getch()return struct node *create_ll(struct node *startstruct node *new_node*ptrint numprintf("\ enter - to end")printf("\ enter the data ")scanf("% "&num)while(num!=- new_node (struct node*)malloc(sizeof(struct node))new_node -data=numif(start==nullnew_node -next nullstart new_nodeelse ptr=start