Suppose you have two algorithms, blarg and wibble, with time complexity Ohm(n logn) and Ohm(n) respectively, blarg modifies the input, while wibble just checks something about the input and returns True or False. You write a new algorithm: For i = 1 to n If wibble blarg End-if End-for Assume all calls to blarg and wibble occur on an input of size n. Suppose wibble always returns True. (It still takes (n) time.) What is the time complexity of the algorithm? Suppose instead that wibble always returns False. What is the time complexity of the algorithm? Suppose instead that for the worst case input, wibble returns True for about log_5(n) values of i in the For loop. What is the time complexity of the algorithm