Consider a min-heap implemented in the usual way by an array ...

1) Consider a min-heap implemented in the usual way by an array A[1,...,N] and a variable used. We are adding a function Decrease Key (A,i,w), which sets Al] min(alt,w), and updates the heap structure appropriately. Show how Decrease Key is implemented such that the run time of the operation is bounded by the height of the heap