i need programming all question answer soonly. make sure the answer are correct. thanks in advance

3. Suppose we have the following sequence: 3,57, 25, 17, 10, 9, 73 (15 Points) (a) Arrange the following values into a min-heap Answer. Show the result of inserting 1 into the min-heap of part a. Answer: Show the restult of a delete-min on the man-beap of pert a Answer: 4. If one uses iterative version (straight two-way) merge sort algorithm to sort the following elements in ascending order 20, 43, 15, 8, 7, 4, 40, 30, 12, 16. Write the each sorting steps. (II Points) Answer: 5. Consider the following acyclic digraph. Assume the adjacency lists are in sorted order: for example, wher iterating through the edges pointing from 0, consider the edge 0-1 before 0-6 010-7. (12 Points) (a) List the DFS (breadth first search) results. Answer 6) List the topological sorting results