The following statements are all true: 89n + 20n +5= O(89n + 20n +5) 89m + 20n +5= O(89n) 89n + 20n +5= O(n0) 89n + 20n +5= O(n) However, the last one is the simplest, cleanest, and tightest of them, and we will refer to it as the minimal big-O form. Write the following expression in minimal big-O notation. (1) n +3. (2) 3nlog(5n). (3) 100 2" +3" (4) 80nlogn +5n + n (5) 1+2+ +n The following statements are all true: 89n + 20n +5= O(89n + 20n +5) 89n + 20n +5= O(89n) 89n + 20n +5= O(n0) 89n + 20n +5= O(n) However, the last one is the simplest, cleanest, and tightest of them, and we will refer to it as the minimal big-O form. Write the following expression in minimal big-O notation. (1) n +3. (2) 3nlog(5n). (3) 100 2" +3" (4) 80nlogn + 5n + n (5) 1+2+ +n