I am currently covering Heaps and Priority Queues. Here is a problem I am trying to complete:

Create two priority queues, as follows:

Create a program called PriorityQueue.java

{"George", "Jim", "John", "Blake", "Kevin", "Michael"}

{"George", "Katie", "Kevin", "Michelle", "Ryan"}

Find the union, difference, and intersection (displayed in the console).

None of this has been taught and the teacher just said that we can look online and find examples of this. Can someone provide me with functional java code for this?