write iterative function

5. Priority Queue (4 points) Suppose we define a priority queue using a circular linked list as follows: typedef struct f int info int priority struct node *pNext / Linked list node/ /info stored in this node /priority stored in this node / Pointer to the next node in linked list * t node typedef struct /*Priority queue / /*Pointer to the last node in the LL /*Its pNext pointer points to the front of the LL / node *pRear; pq Write an iterative function to find and return a pointer to the first node in the priority queue with a info value equal to the parameter val. return back to pRear node* find ( pq queue, int val )f