Please show all work for these particular functions (no copy and paste of other functions). Thanks!

Suppose you have algorithms with the three running times listed below. (Assume these are the exact running times.) How much slower do each of these algorithms get when you (a) double the input size; or (b) increase the input size by one? (So you should give two answers for each of the three.) For some functions, you might show the answer in terms of a ratio; for others, in terms of a difference. Assume that all logs are base two. (1) f(n)=31n2+4 (2) f(n)=2n+n (3) f(n)=nlogn