show that + is ( nr- show that is (nlognr- show that is ohm( log nr- show that nlogn is ohm(nr- show that [ ( )is ( ( ))if (nis positive nondecreasing function that is always greater than - algorithm executes an (logn)-time computation for each entry of an nelement array what is the worst-case running time of algorithm ar- given an -element array xalgorithm chooses logn elements in at random and executes an ( )-time calculation for each what is the worst-case running time of algorithm br- given an -element array of integersalgorithm executes an ( )-time computation for each even number in xand an (logn)-time computation for each odd number in what are the best-case and worst-case running times of algorithm cr- given an -element array xalgorithm 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 (nlogn)-time method is always faster than bob' ( )-time method to settle the issuethey