Time complexity

Question

Answer 1

We derive Asymptotic Bounds For LARGER VALUES

say n=10000000

(so here smallers have no importance)

because large input is the case that an algorithm wants to analysis

so here g1=O(n²) and g2=O(n³)

so

a is correct answer

Comments

But $g1(n)$ is not defined for large $n$ :O

---

oh my mistake.. should i remove the selection?

actually while selecting i saw upvotes and selected..

---

I think it is a typo in question.

---

yes that's true..and if not a typo then also the highest value should be taken in consideration..so answer should be same

---

given these options. Otherwise "None of these" should be the answer :)