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.
