Can someone please help me with this with brief explanation? thank you!!

5. Using tree diagrams, trace the construction of a heap from the integers 3,5,4,10,1,7,9 ,6,2,8 when (a) the numbers are inserted into the heap one at a time from left to right, (b) the items are added to the heap all at once (in this order) and the heap is reheapified 6. Provide pseudo-code for to use a priority queue to read a file of integers and report the 10 largest integers in the file