2 b pls

2n 0(2") 2. By using the Big-Oh definition and formal proof, show that a. Show that 0(log ) O(log, n) for a, b>1 If(n) is O(g(n)) and g(n) is O(h(n)), use the definition of Big Ob to show that f(n) is O(h(n)). b