Design an efficient algorithm for finding and deleting anelement of the smallest value in a max-heap A[1..n] where nge 1. What is the running time of youralgorithm?