fill the following array in a heap A=[11, 9, 7, 23, 25, 7, 18, 9, 10,17,22, 24, 7, 5,6] and apply build heap bottom- up approach , then answer on the following questions : 1. where is located the...

fill the following array in a heap A=[11, 9, 7, 23, 25, 7, 18, 9, 10,17,22, 24, 7, 5,6] and apply build heap bottom- up approach , then answer on the following questions :

1. where is located the largest item in the heap

2. what is the running time of build heap algorithm