Assume you have two algorithms, a and b, both of which perform the same function, although their implementations differ. assume that algorithm a has a running time of o(n3 + 2n2+6n +10) and algorithm b has a running time of o(6n2 + 3n +10 ). also assume that the value of n is restricted to the set of natural numbers i. e., {1, 2, 3, }. answer the follow­ing questions:

for what values of n algorithm a is more efficient than algorithm b?

for what values of n algorithm b is more efficient than algorithm a?

for what values of n might both algorithms be expected to operate with the same efficiency?