notes if(front =nullfront xx->next nullrear / is the first node being added to the priority queue*elseif(front->priority px->next frontfront / has the highest priority hence should be at the front*elseif(rear->priority px->next nullrear->next xrear / has the least priority hence should be at the rear*else / has to be inserted in between according to its priority* frontpr ->prir nullwhile(pr /advance through the queue till the proper position is reached * ->nextr fpr ->priority/ now points to the node before which has to be inserted and points to the node which should be before * ->next xx->next ftask write an implementation of the extended_queue method full in light of the simplicity of this method in the linked implementationwhy is it still important to include it in the linked class extended_queuelovely professional university