Q1- Use the master method, to show that the solution to the recurrence

Q2- Illustrate the operation of heapSort on the below array:

A= {40, 96, 77, 59, 30,80}

Q3:

What is the node number of the parent of node 9?

What is the node number of the right child of node 17?

What is the node number of the left child of node 4?

T(n) = 9 T(n/3) + (n*) Theore 4.1 (Master theorenn) 1. If f(n)-O (nlogba-r) for some constante > 0, then T (n)-(nlogba). 2. If f(")=(nlogba), then T(n)= (nlogb algn). 3. If f(n)-(nlogb ate) for some constant > 0, and if af(n/b) cf(n) for some constant c