Use the comparator for a priority queue: Alg Compare(k1, k2) if k1==k2 return 0; if k1 k2 return 1; Then we preformed 3 inserts: insert(5,A),

Use the comparator for a priority queue:

Alg Compare(k1, k2)

if k1==k2 return 0;

if k1

if k1>k2 return 1;

Then we preformed 3 inserts: insert(5,A), insert(3,B), insert(4,C)

a. What is the output data for the first removeMin():

b. What is the output data for the second removeMin():

c. What is the output data for the third removeMin():