Design an algorithm and c-program to insert a data element into sorted single linear linked list (SLLL).
Design an algorithm and c-program to insert a data element into sorted single linear linked list (SLLL). Algorithm: Insert sort SLLL. Input: 1) F, address of a first node of sorted list.2) e element to be inserted. Output: F, Updated. Method: n = getnode() [n].data = e if ( F= = NULL ) [n].link = = NULL F = n elseif ( e < = [ F ].data ) then [n] .link = F f = n else T = F // check the list for next node while (( [ T ].link ! = NULL ) and ( [ [ T ] . link] . data < e ) ) do T = [ T ] .link while end [ n ].link = [ T ].link [ T ].link = n if ends if ends Algorithm ends // C PROGRAM #include <stdio.h> #include <stdlib.h> // Structure of a node struct Node { int data; struct Node* link; }; struct Node* F = NULL; // Head of the list // Function to insert a node in sorted order void insertSorted(int data) { struct Node* newNode = (struct Node*)malloc(sizeof(struct Node))...