Q1. In all algorithm, always explain how and why theywork. If not by a proof, at least by a clear explanation. ALWAYS,analyze the running time complexity of your algorithms. Do notwrite a program. Write pseudo codes or explain inwords.
(A) Find an efficient data structure supporting the followingoperations. Insert(S, x), Delete−Max(S), and Delete−100'th(S) whichdeletes from H the 100 largest element in the structure. Assumethat the number of elements is more than 100. Also assume that thenumbers are pairwise distinct and so the 100”th largest element iswell defined.
(B): Recall the problem in which you have k sorted array each ofsize n, which need to make one single sorted array. Find anotherfast way to unite the arrays that does not use Priority Queue.
