Objective: Understand the function $`$whatDoesItDo$`$ that manipulates a singly linked list and

demonstrate its effect on a given linked list.

Structure Definition:

typedef struct node $\{$

int num;

struct node$*$ next;

$\}$ node;

Function Signature:

int whatDoesItDo$($node $*$head$)$;

Sample Edge Cases:

Empty List:

$$ The head pointer is NULL. The function should handle this case gracefully by returning NULL

or head.

Single Node List:

$$ The list contains only one node. The function should not attempt to access next pointers

that do not exist.

Two Node List:

$$ The list contains only two nodes. The function should correctly handle the case where

other$->$next is NULL.

Odd Number of Nodes:

$$ The list contains an odd number of nodes. The function should correctly handle the traversal

and manipulation without causing any segmentation faults or incorrect links.

Even Number of Nodes:

$$ The list contains an even number of nodes. The function should correctly handle the

traversal and manipulation without causing any segmentation faults or incorrect links.

Write a code that will Create $5$ separate linked lists or a dynamic singular linked list that will complete all those $5$ edge cases please!