Implement these five bulleted validations for a doubly Linked list in C programming. Thank you.

The prev and next pointers form the links between nodes in the list, and the value field stores the value present at the node. In a well-formed list, the following properties are always true: The empty list is represented by NULL The prev pointer of the first node (head) of a non-empty list is NULL The next pointer of the last node (tail) of a non-empty list is NULL For every node with a non-null prev pointer, the next pointer of the node's prev is the node itself. (That is, node->prev>nextnode.) For every node with a non-null next pointer, the prev pointer of the node's next is the node itself. (That is, node->next->prevnode.) This means that the following special lists exist: The empty list, represented by NULL The single-element list, represented by a single node where both prev and next are NULL