insert nod, new, into sorted priority queue

4. Priority Queue (3 points) Suppose linked list as follows: we define a priority queue using a circular doubly / Linked list node */ /* info stored in this node / /* Pointer to the next node in linked list /*Cor the front node of LL if this is the rear node) / struct node f int info; struct node *next; Pointer to the next node in linked list / /*Cor the rear node of LL if this is the front node) / node *prev j: /*Priority queue */ /*Number of elements in queue */ struct pq f int size; struct node *front /* Pointer to the first node / struct node rear* Pointer to the last node / J; te an iterative (i.e.. given node, new, into a sorted priority queue. void insert (struct pg *queue, struct node *new) ( ne