algorithms

I need the answers to check my solution!!!

2. Asymptotic Notation Exercises. (20 points) Indicate whether each of the following statements is True or False then justify your answers; if true, show the necessary constants (e.g., c,n0, etc.) that satisfy the notation, and if false, argue that no such constants exist. (a) 3n2+n+10=(n2) (b) n=(n2) (c) 10lgn=(1) (d) lgn8=O(lgn) (e) 3n=O(2n) (f) 100n3=o(n3lgn) (g) 5n10=(n10) (h) 3log7n=(log2n) (i) log2(n)=O(log(n2))( Note: log2(n)=log(n)log(n)) (j) n21=O(1)