Big O notation has a concept of a dominant (highest order) term. The dominant term is the single behavior within the algorithm that has the most significant impact on performance. When devising Big O notation for an algorithm, you can safely ignore all of the steps besides that dominant term, because, as the the number of inputs approach infinity, less dominant terms have an effectively invisible impact on performance A. True B. False