Question

ma E. Asymptotic Analysis rays For these problems, you should give a brief explanation as hws.txt. You should not use any fancy typesetting tools (like LaTeX, Word, etc.). Just submit a text file called hws.txt. You are not required to explain your solutions, but you are encouraged to do so. Provide simple and tight asymptotic bounds for each of the following. Here, "simple" means roughly "no unnecessary terms or constants' and "tight" means "either the largest Ω(-) and smallest 0(-) bounds you can find, or if possible, a Θ(-) bound." 1.9x23x+14 log r 2 log(4x3 22) 4. The worst case running time of the following code fragment: int j1 07 for (int i = 0; i<N; i += 1) { for j< M; j 1) t if (bump (i, 5)) break; Assume that M and N are integers, and bump is a constant- time (0(1) method that returns a boolean result. We're S/6 x.haml
Please give explanation as well

Answer 1