How do I do these three questions, thank you

#10 should be done in pseudocode

(8) (10 pts) Show the merge of the following two leftist heaps. 50 10 19 12 13 20 10 30 16 25 (9) (10 pts) Show the result of merging the two binomial queues 12 1- 20 2 8 (o ct 23 (10) (20 pts) Given a non-empty array of integers, return the k most frequent elements in O(n) time