Q1. In all algorithm, always explain how and why they
work. If not by a proof, at least by a clear explanation. ALWAYS,
analyze the running time complexity of your algorithms. Do not
write a program. Write pseudo codes or explain in
words.
(A) Find an efficient data structure supporting the following
operations. Insert(S, x), Delete−Max(S), and Delete−100'th(S) which
deletes from H the 100 largest element in the structure. Assume
that the number of elements is more than 100. Also...