Data Structures and Algorithms

1. Express the following three functions with Big-Oh notation: f(n) = 4n²+5nlogn+8

2. give an analysis of the running time using Big-Oh notation.

1. sum = 0;

for( i = 0; i < 2n; i++ ) (5 points)

sum++;

3. Show that 2n²+4 is O(n²). (pick c and n₀)