[Solved]596 Insert Following Numbers Initially Empty Min Heap One One Show Resulting Heap Insertio Q37158443

Please show the pseudocode , thx

(a) [596] Insert the following numbers into an initially empty min-heap one by one. Show the resulting heap after each insertion. Show the resulting heaps after executing the Extract-Min operation twice. 4) 198, 167, 132, 158, 202, 146, 177,41, 148, 212, 136 (b) [10%] Given n distinct numbers (not sorted), design an O(n + k log n) algorithm to retrieve the k smallest numbers. Show transcribed image text (a) [596] Insert the following numbers into an initially empty min-heap one by one. Show the resulting heap after each insertion. Show the resulting heaps after executing the Extract-Min operation twice. 4) 198, 167, 132, 158, 202, 146, 177,41, 148, 212, 136 (b) [10%] Given n distinct numbers (not sorted), design an O(n + k log n) algorithm to retrieve the k smallest numbers.

Expert Answer

---

Answer to (a) [596] Insert the following numbers into an initially empty min-heap one by one. Show the resulting heap after each i… . . .