The operation heap-delete (a, i) deletes the item in node i from heap a. give an implementation of heap-delete that runs in o (lg n) time for an n-element heap.

Ithink the answer is d hope it

As computers and other digital devices have become essential to business and commerce, they have also increasingly become a target for attacks. in order for a company or an individual to use a computing device with confidence, they must first be assured that the device is not compromised in any way and that all communications will be secure