1. A.,. Give a Big-O estimate that is as good as possible for each of the following functions. i. (n3 + n)(logn + n) ii. (n + 1000)(logn + 1) В. If these are complexities of algorithms that solve the...

Extracted text: 1. A.,. Give a Big-O estimate that is as good as possible for each of the following functions. i. (n3 + n)(logn + n) ii. (n + 1000)(logn + 1) В. If these are complexities of algorithms that solve the same problem, which one would you prefer? Why? C. other solution for an input size of 216? Considering the Big-O complexity, how many times is your choice faster with respect to the Note: The base of logarithm is 2.