Screenshot 2021-02-08 at 16.12.40 Screenshot 2021-02-08 at 16.12.05 Screenshot 2021-02-08 at 16.17.39 Screenshot 2021-02-08 at 16.22.08 16 Q Search Select all correct statements below Select one or more: Any algorithm which is O(n) is O( n2) An algorithm which is O( 1 ) will always be faster than one which is ( n) Any algorithm which is O(n) is O(n) Any algorithm which is N( n ) is O(n) Two algorithms which are O(n) will take the same amount of time to run for the same input. Fifth O(n) O( n2) On) On3