Question

Of the following statements, which ones can be said to be TRUE?

1. The time complexity of all single statements is constant

2. According to the Big O Notation, the time complexity of some statements can be said to be logarithmic

3. Time complexity can only be expressed by using the Big O notation

4. Time complexity can be expressed as a differential equation

5. The time complexity of an algorithm can vary over time

6. Quadratic time complexity can be expressed as a quadratic equation

a) 1, 3 & 5

b) 2 & 4

c) 5, 2 & 6

d) 2 & 6

e) 2, 4 & 6