- show that (nis ( ( )if and only if (nis of ( ) - show that if (nis polynomial in nthen log (nis (log nr- show that ( ) is ( - show that + is ( - show that is ( log nr- show that is ( log nr- show that log is (nr- show that ( )is of ( ))if (nis positive nondecreasing function that is always greater than - give big-oh characterizationin terms of nof the running time of the example function shown in code fragment - give big-oh characterizationin terms of nof the running time of the example function shown in code fragment - give big-oh characterizationin terms of nof the running time of the example function shown in code fragment - give big-oh characterizationin terms of nof the running time of the example function shown in code fragment - give big-oh characterizationin terms of nof the running time of the example function shown in code fragment - for each function (nand time in the following tabledetermine the largest size of problem that can be solved in time if the algorithm for solving takes (nmicroseconds (one entry is already completed second log hour month century log - algorithm executes an (log )-time computation for each entry of an -element sequence what is its worst-case running timer- given an -element sequence salgorithm chooses log elements in at random and executes an ( )-time calculation for each what is the worst-case running time of algorithm br- given an -element sequence of integersalgorithm executes an ( )-time computation for each even number in sand an (log )-time computation for each odd number in what are the best-case and worstcase running times of algorithm