$(10$ points$)$ Let $A[1..n]$ be an array representation of a min$-$heap of in$-$

tegers. Describe an algorithm for implementing an operation ADD$(i,x)$

that adds an integer $x$ to the element $A[i]$ and restores the array to a

min$-$heap afterwards. Analyze the running time of your algorithm.