This is about predicate logic involving big O notation. I undertand this concept for the most part, except when it comes to big O questions, appreciate the help, thanks!

[9 marksl Order Notation. In this question we consider algorithms A, B with runtime functions a(n), b(n) For cach of the following three scenarios, indicate whether the claim is truc or false, and gi (a) [3 marks] If a(n)-8n2 and b(n)-2n2 + (log2 n)3, then a(n) o(b(n)). ve an informal argument to support your answer. marKS