Assume in the following ConsSum algorithm, the loop highlighted contains the essential operation in the innermost loop of the algorithm.

where f(n) is a function of n that is defined in the algorithm before the innermost loop. Furthermore, we know f(n) O(1). Based on that assumption, what is the efficiency class of the time complexity? Can sombody help me justify your answer carefully.

Algorithm ConsSum (n) \# Input: positive integer number n ... for i0 to n do for j1 to n do ai+j+f(n)