her algorithm' correctness could be established on any given and in (ntime - given two sets and represented as sorted sequencesdescribe an efficient algorithm for computing bwhich is the set of elements that are in or bbut not in both - suppose that we represent sets with balanced search trees describe and analyze algorithms for each of the methods in the set adtassuming that one of the two sets is much smaller than the other - describe and analyze an efficient method for removing all duplicates from collection of elements - consider sets whose elements are integers in the range [ , popular scheme for representing set of this type is by means of boolean arraybwhere we say that is in if and only if [xtrue since each cell of can be represented with single bitb is sometimes referred to as bit vector describe and analyze efficient algorithms for performing the methods of the set adt assuming this representation - consider version of deterministic quick-sort where we pick as our pivot the median of the last elements in the input sequence of elementsfor fixedconstant odd number > argue informally why this should be good choice for pivot what is the asymptotic worst-case running time of quick-sort in this casein terms of and dc- another way to analyze randomized quick-sort is to use recurrence equation in this casewe let (ndenote the expected running time of randomized quicksortand we observe thatbecause of the worst-case partitions for good and bad splitswe can write ( < / ( ( / ( / )( ( )bn