Compexity of sum of complexity bounds

Question

Answer 1

F(n)= time complexity will be never be less than N

g(n)= time complexity will be never be less than N²

now if we add two we get omega (n²)

i thnik C should be the answer .

correct me if wrong