Could you guys help me with this problem.
Let f ( n ) = b + a n , where a is not equal to 0 , then O ( f ( n ) ) is
(a) O ( 1 )
(b) O ( a )
(c) O ( b )
(d) O ( n )
(e) O ( n^2 )
Please check my answer(Bold):
Which of the following is NOT a true statement?
(a) The merge sort and insertion sort both divide the list into two equal sized subsets.
(b) The bubble sort compares elements that are adjacent to each other.
(c) The merge sort is more efficient than the insertion sort.
(d) Both (a) and (c)