Which of the following statements about big o notation is false? a. an o(n) algorithm's run time (in seconds) will always be faster than an o(n^2) algorithm's run time b. you cannot sort an arraylist faster than o(n log n) c. constant time is o(1) d. an algorithm that takes 3n + 5 steps has the same complexity class as an algorithm that takes 4n + log(n) steps.