Can anybody help with this data structures problem?

Problem 12 What is the output of the following code: MinHeap Integer> heap new MinHeap); TreeSet set new TreeSet(); for (int i = 5; i >-1; i--){ heap . add ( i ) ; set.add (i); for statelemerint.eelement + heap.remove()); System.out.println (element heap.remove ())