Translate to C++ add comments where needed.

PriorityQueue.java: import java.util.LinkedList; public class MyPriorityQueue> { LinkedList list; public MyPriorityQueue() { list = new LinkedList(); } public T deleteMin() { if(list.size() == 0) { return null; } else { // assume index 0 is minimum int min = 0; for(int i=0; i 0) { min = i; } } T data = list.get(min); // remove element list.remove(min); return data; } } public void add(T data) { if(data == null) { return; } list.add(data); } public int size() { return list.size(); } public static void main(String[] args) { MyPriorityQueue pq = new MyPriorityQueue(); pq.add(3); pq.add(13); pq.add(34); pq.add(12); pq.add(57); System.out.println("Retrieving values from priority queue:"); while(pq.size() != 0) { System.out.println("Retrieved: " + pq.deleteMin()); } } }

DMyPriorityQueue,java 3 7 8 public MyPriorityQueue() 9 list = new LinkedList()(); 10 blic T deleteMin) if(list.size() == 0) { 14 15 16 17 18 19 20 21 return null; else // assume index is minimum int min = 0; for(int i-0; ilist.size; itt f // check if item is lesser than minimum index, then update if(list.get(min).compareTo(list.get(i)) ) { min = i; 23 24 25 26 27 28 29 30 31 32e public void add (T data) T data 11st.get (min); // remove element list.remove(min); return data; if(data == null) { return; 34 35 36 list.add(data); Console X