I need complete solution for this question

Its from Algorithms and Complexity

2 Asymptotic Notations For this problem, you need to base your answer on the definitions of the asymptotic notations (not the common sense rules) 1. Show 8n3logn +14n2 6(n3logn). 2. If f(n) O(g(n), can we conclude 2)o(2))? Justify your answer. 3. Prove for any integer constant and real constant b, (n + b)" = (na). In fact, this holds even when a is a real constant, but you do not have to prove it