Assume the priority queue also must support the update DELETE(A,i), where i gives you the location in the data structure where element i is located. In a binary heap, that would be A[i]. Write pseudocode to achieve DELETE(A,i) in O(log n) time for binary heaps, where n is the size of the heap. Justify the running time.