A linked list is a linear collection of data elements, called nodes pointing to the next node by means of pointer. It is a HYPERLINK "https://en.wikipedia.org/wiki/Data_structure" \o "Data structure"...

A linked list is a linear collection of data elements, called nodes pointing to the next node by means of pointer. It is a HYPERLINK "https://en.wikipedia.org/wiki/Data_structure" \o "Data structure" data structure consisting of a group of HYPERLINK "https://en.wikipedia.org/wiki/Node_(computer_science)" \o "Node (computer science)" nodes which together represent a HYPERLINK "https://en.wikipedia.org/wiki/Sequence" \o "Sequence" sequence. Under the simplest form, each node is composed of data and a HYPERLINK "https://en.wikipedia.org/wiki/Reference_(computer_science)" \o "Reference (computer science)" reference (in other words, a link) to the next node in the sequence; more complex variants add additional links. This structure allows for efficient insertion or removal of elements from any position in the sequence. A head pointer is used to track the first element in the linked list therefore it always points to the first element. c linked list A linked list whose nodes contain two fields: an integer value and a link to the next node. The last node is linked to a terminator used to signify the end of the list. Below is a node declaration of a linked list using a HYPERLINK "http://www.zentut.com/c-tutorial/c-structure/" \o "C structure" structure: /* a node of the singly linked list */ typedef struct { int data; struct node *next; } node; In order to create a linked list similar to the above figure, you need to do the following: Implement a function that creates a new node and return a pointer to it. Call this function each time you want to insert a new node into the list. This function allocates memory, fill with information and return a pointer to the new node. Write the implementation of a function to add a node at the beginning of list. Figure 1 illustrates how to insert a node when the list is empty: Add a node into an empty linked list Figure 1: Add a node into an empty linked list Figure 2 illustrates how to insert a node at the beginning of a non-empty linked list: Add a new node at the beginning of a non-empty linked list Figure 2: Insert a node at the beginning of a non-empty linked list Write a function to print the linked list. Call your insert function in a test program that creates a linked list of four integers and call your print function to print the created list.