This question involves predicate logic and big O notation, i'd appreciate some help, can't figure this out because I can't wrap my head around how big O works in these problems, thanks!

[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) = 4n2,b(n) = 3n4 and o(n) = n2-10, then a(n) + b(n) 13 marks! O(c(n)