Can someone help me with the implementation of this template class, it should be in C++ and the task is to create a Priority Queue using Linked List and pass the test cases on the driver.cpp file. Thank you. Here is the code:

#include template

class priorityQueueLL { private: class node { public: //put what you need here.. }; //add what you wish here

public:

priorityQueueLL() { }

~priorityQueueLL() { }

//return true if empty, false if not bool empty() { }

//add item void insert(T x) {

}

//remove and return smallest item T extractMin() { }

};

#include #include #include "priorityQueueLL.h" using namespace std;

int main()

{

/////////////////////////////////////////

//////////Test code for priority queue/////

priorityQueueLL pQueue;

const int SIZE = 20;

//insert a bunch of random numbers for (int i = 0; i < SIZE; i++) { pQueue.insert(rand()); }

//pull them back out.. while (!pQueue.empty()) { cout << pQueue.extractMin() << endl; } priorityQueueLL pqs;

pqs.insert("whale"); pqs.insert("snake"); pqs.insert("buffalo"); pqs.insert("elmo"); pqs.insert("fire"); pqs.insert("waffle");

while (!pqs.empty()) { cout << pqs.extractMin() << endl; } ///////////////////////////////////////////

return 0; }