Which is used to measure the Time complexity of an algorithm Big O notation?

• A. describes limiting behaviour of the function
• B. characterises a function based on growth of function
• C. upper bound on growth rate of the function
• D. all of the mentioned