Problem1: Please build the min-heap tree for the following given inputs:A=[23, 1, 0, 56, 12, 13, 34, -1, 16, 8] Then show the tree after each applying each of the following operations(the ordering of the operations is 1, 2, 3, 4, 5, 6, and 7):

1)removeMin()(removes the root)

2)Insert (10)

3)removeMin()

4)Insert (-5)

5)removeMin()

6)Insert (-8)

7)removeMin()