step if start null write underflow go to step [end of ifstep set ptr start step set preptr ptr step repeat steps and while preptr -data !num step set preptr ptr step set ptr ptr -next [end of loopstep set temp ptr step set preptr -next ptr -next step free temp step exit figure algorithm to delete the node after given node programming example write program to create linked list and perform insertions and deletions of all cases write functions to sort and finally delete the entire list at once #include #include #include #include struct node int datastruct node *next}struct node *start nullstruct node *create_ll(struct node *)struct node *display(struct node *)struct node *insert_beg(struct node *)struct node *insert_end(struct node *)struct node *insert_before(struct node *)struct node *insert_after(struct node *)struct node *delete_beg(struct node *)struct node *delete_end(struct node *)struct node *delete_node(struct node *)struct node *delete_after(struct node *)struct node *delete_list(struct node *)struct node *sort_list(struct node *)int main(int argcchar *argv[]int optiondo printf("\ \ *****main menu *****")printf("\ create list")printf("\ display the list")printf("\ add node at the beginning")printf("\ add node at the end")printf("\ add node before given node")printf("\ add node after given node")printf("\ delete node from the beginning")