Apriority queue is a queue in which each item is inserted in to the queue at a location determined by its priority. when a new element is added to the queue, it is moved in front of all other elements in the queue whose values are smaller than it. in other words, larger the element higher the priority. as you can imagine, the code for the priority queue should be almost the same except, when we insert new elements, we need to insert it to the correct place. write the necessary java code for priorityenque method. as you can see i have changed the generic type parameter of the listqueue so that anytype is comparable. you should use the given template g