NOTE: The code should be in C Language. Thanks

You are to implement a singly linked list: The List will always have a dummy node as its first node, the head pointer of the linked list will always point to this node. Any values to be added to this list will be added to new nodes and linked to this first dummy node. y node it holds no data (data field in this link object is left empty) just the next pointer will point to the first link that stores user value of 3. You are to implement a Queue as a linked list. The Queue offers only two operations. Dequeue: Will always remove the first value in the list (the link node after the dummy head node) and Enqueue: Will always add an element to the last of the list. Data held in your list is simple, just an integer as shown in the diagram