Problem 6. Show that n2/140 is not O(n). Show that n! is O(n"). Show that n6 + 16n4 + 215 is O(no). Show that n.0001 is not O((log n)1000). (Page 57 of CLRS third edition has a helpful proof.) Compare two running times: 2 and 3