Esc NODE 'back; public: -PQueueLinkedList()XdestroyListo:) void enqueue(NODE ") pqueueLinkedList(tront- NULL;back NULL) NODE' dequeue(l): void destroyList): void PQueueLinkedList:enqueue(NODE 'n) IflfrontNULL) liqueue has one node. front n back-n elsellqueue has more than one node #1 f( n-data.id> temp->data.id) New node id's is greater than all others. n>N front; front n else IrSearch for the position for the new node. whilel n->data.id data.id) if(temp->N == NULL) break; temp temp>N; I/New node id's smallest than all others iftemp->N NULL&& n>data.id data.id) #2 back n; else WNew node id's is in the medium range. temp>P>N n n-P temp->P; temp->P n; NODE PQueueLinkedList::dequeue0 NODE 'temp; if( backNULL) IIno nodes else if(back->P = NULL) /there is only one node return NULL