answer algorithms question a, b and c

1. For all pairs of functions below, prove whether f(n) is O(g(n)) or g(n is O(m)) (or both). (You might find it helpful to look up the rules of loga- rithms). f(n g(n) (a) n (b) log 5n + 2 log 2n + 5 (c) 10 log n log(n) 2 Tn