Answer the following statements true (T) or false (F)

1) A growth function shows the relationship between the size of a problem and the part of an algorithm that we are trying to
optimize.
2) When comparing two growth functions, a larger exponent on the problem size in the growth function indicates greater
efficiency.
3) If the problem size is fairly small, then there is little difference between the efficiencies of different algorithms.
4) When determining the complexity of a segment of code, simple print statements are generally O(1).
5) When evaluating the complexity of a loop, all statements in the loop body are considered to be O(1).

1) T
2) F
3) T
4) T
5)F