please help im stuck

programming language is c

Consider the process of merging two queues, q1 and q2, into one queue. One way to manage this process fairly is to take the first item in q1, then the first item from q2, and continue alternating from the two queues until one of the queues run out, followed by taking all of the items from the queue that has yet to run out in the original order. For example, if q1 contains 3,8,2,7 and 5 , q2 contains 6,11,9,1,4 and 10 . then merging the two queues would create a queue with the following items in this order: 3,6,8,11,2,9,7,1,5,4, and 10 . Assume that the following struct definitions and functions with the signatures shown below already exist. typedef struct node \{ int data; struct node* next; Inode; typedef struct queue \{ node* front; node* back; Iquece; // Initializes the quede pointed to by my m to be an empty quede. void initializelqueue* myQ i; // Enquecles the node pointed to by item into the quecle pointed // to by myQ. void enquede(quede* myQ, node* item); // Removes and returns the front node stored in the quele /I pointed to by myQ. Returns NULL if myQ is empty. node* dequede(queue* myQli // Returns the number of items in the quecle pointed to by myQ. int size(queue* myQli Write a function that takes in two queues, q1 and q2, and merges these into a single queue, emptying out q1 and q2 in the process and returning a pointer to the resulting queue. queue* merge (quedeq1,q que* q21{}