Describe the worst case running time of the following functions f(n) in big-o notation in terms of the variable n. this should be the tightest bound possible. unless otherwise specified, all logs are base 2, but you do not have to write the base for the log in your answer. you do not need to explain your answer.