This question is about big O and predicate logic. I can't figure out how to do these problems when they use big O in them, thanks, appreciate the help!

[9 marks] Order Notation. In this question we consider algorithms A, B with runtime functions a(n), b(n) For each of the following three scenarios, indicate whether the claim is true or false, and give an informal argument to support your answer If a(n) 23 loga " and b(n )-n- 5n, then a(n) E O(b(n). 3 log2 n