self doubt

Question

It has been proved that A<B i.e A is polynomial reducible to B. The polynomial reductionn is carried out in time of O(n). The problem B can be solved in O(n^3) time. what is them taken to sovle problem A ??

Comments

now it is clear got it ....thanx

---

like first we willrequire O(n) time to reduce...A to B then O(n^3) to solve B.. So out of this O(n^3) is dominationg so we will consider it i.e. O(n^3+n)=O(n^3)..

---

thankyou mam