input: Background: Upper and lower bounds are usually stated using the big O notation, which hides constant factors and smaller terms. This makes the bounds independent of the specific details of the computational model used. For instance, if T(n) = 7n2 + 15n + 40, in big O notation one would write T(n) = O(n2).
  Question: What does a big O notation hide?
  Answer:<extra_id_0>.
output: <extra_id_0> constant factors and smaller terms<extra_id_1>