typedef struct queue {

Node *head;

Node *tail;

int items; }Queue; Write a function Queue *merge(Queue *q1, Queue *q2) that takes two queues. Each queue contains integers in ascending order. You need to create a third queue that will contain all integers from q1 and q2, and the entire queue will be sorted. Q1: 12->34->56->70 Q2: 1->5->11->20->38->50->100 Final queue: 1->5->11->12->20->34->38->50->56->70->100