- given an -element sequence salgorithm calls algorithm on each element [ialgorithm runs in (itime when it is called on element [iwhat is the worst-case running time of algorithm dr- al and bob are arguing about their algorithms al claims his ( log )time method is always faster than bob' ( )-time method to settle the issuethey perform set of experiments to al' dismaythey find that if is the ( log )-time one better explain how this is possible - there is well-known city (which will go nameless herewhose inhabitants have the reputation of enjoying meal only if that meal is the best they have ever experienced in their life otherwisethey hate it assuming meal quality is distributed uniformly across person' lifedescribe the expected number of times inhabitants of this city are happy with their mealscreativity - assuming it is possible to sort numbers in ( log ntimeshow that it is possible to solve the three-way set disjointness problem in ( log ntime - describe an efficient algorithm for finding the ten largest elements in sequence of size what is the running time of your algorithmc- give an example of positive function (nsuch that (nis neither (nnor (nc- show that ni= is ( - show that ni= / (hinttry to bound this sum term by term with geometric progression - show that logb (nis th(log ( )if is constant - describe an algorithm for finding both the minimum and maximum of numbers using fewer than / comparisons (hintfirstconstruct group of candidate minimums and group of candidate maximums - bob built web site and gave the url only to his friendswhich he numbered from to he told friend number that he/she can visit the web site at most times now bob has counterckeeping track of the total number of visits to the site (but not the identities of who visitswhat is the minimum value for such that bob can know that one of his friends has visited his/her maximum allowed number of timesc- draw visual justification of proposition analogous to that of figure (bfor the case when is odd