Sort the following integers in Descending order by constructing a Heap Tree (heap-sort). You must draw heap tree status after each extraction

0, -10, 100, 9, 15, -50, 6, 50, 10

Construct a BST whose Pre-Order Traversal output is

15, 5, 2, 10, 25, 18, 16, 20

only constract of both.

i want in 30 mint