R-3.1 Graph the functions 8n, 4nlogn, 2n2, n3, and 2n using a logarithmic scale for the x- and y-axes; that is, if the function value f(n) is y, plot this as a point with x-coordinate at logn and y-coordinate at logy. R-3.3 The number of operations executed by algorithms A and B is 40n2 and 2n3, respectively. Determine no such that A is better than B for n no. R-3.8 Order the following functions by asymptotic growth rate. 4nlogn+2n 210 2logn 3n+100logn 4n 2" n + 10n n nlogn R-3.28 For each function f(n) and time t in the following table, determine the largest size n of a problem P that can be solved in time t if the algorithm for solving P takes f(n) microseconds (one entry is already completed). logn n nlogn n 2" 1 Second 1 Hour 1 Month 1 Century 10300000