algorithm analysis big o

4. Using the definitions of Big-O and and (15 pts)

a. Show that n² + 3n+ lg(n) O(n²)

b. Show that n² + 3n +lg(n) (n²)

c. Show that n² + 3n +lg(n) (n²)