Write a full C++ Classes that implement a priority queue using single linked list. The class Node should include the following three attributes and functions: Integer data, pointer to next node and the priority of data as integer Constructor Assume lower values of priority indicate higher priority: means if priority=0 then this is the highest priority and the data should be at the head of linked list a. The class PriorityQueueAsLinkedList should include the following attributes and functions: > Linked list representation (head) > Constructor Destructor (remove the whole priority queue) pop()://Removes the element with the highest priority form the list peek()://retrieve the value of the highest priority push(data, priority): Function to push data to linked list according to priority Sample example: // Create a Priority Queue Priority Queue AsLinkedList pq: pq.push(4, 1); pq.push(5, 2); pq.push(6, 3); pq.push(7,0); //The resulted priority queue should be as follow: 7->4->5->6 cout