Give an efficient implementation of INSERT in a d-ary max-heap. Analyze its running time in terms of n and d.

MAX-HEAP-INSERT (A, key) 1 A.heap-size = A.heap-size + 1 2 A[A.heap-size]=-oo 3 HEAP-NCREASE-KEY (A.A.heap-size,key)