Implement a queue in C++ using structures and pointers only the same way as we did for List and
Stack. DON’T USE CLASSES OR TEMPLATES. Gather all the functions and the node structure in one
header file called Queue.h. The following functions should be included:
void enqueue(int item, Node* queueHeader) Add new item to the end of the queue
int dequeue(Node** queueHeader) Return and remove the first item
bool isEmptyQueue(Node* queueHeader) Return true if the queue is empty
void deleteAll(Node** queueHeader) Make the queue empty
int queueSize(Node* queueHeader) Return the size of the queue (number of nodes)
void printQueue(Node* queueHeader) Print all values in the correct order
At first, assume that the data to be stored in the queue are all integers.
