Definition: In this task, you are given a passage and a question regarding that passage. You must determine whether or not the question is answerable from the given passage. If a question is answerable, output should be 'True', otherwise 'False'. You must not consider any other information that is not provided in the passage while labelling True or False.
Input: Passage: 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: Big O notation provides autonomy to upper and lower bounds with relationship to what? 

True