Problem 5 Given the list of functions below, determine a tight bound for each function in big-Theta notation and list the functions or sets of functions in order of slowest growing to fastest growing. Be sure to put functions in the same set that grow at the same rate. As usual, you can assume that all logarithms are base 2 unless otherwise noted. Note: log(n!) is O(nlogn). 1. 2. 3. 4. 4nlog(4+4) In(log(4n)) + 2(4logn+1) 612 4logs? 16 m2 logk k=1 5. n 6. (3k + 3k ) k=1 logn 7.