CountValuesLessThanT Input: a₁, a₂,...,a_n n, the length of the sequence. T, a target value. Output: The number of values in the sequence that are less than T. count = 0 For i = 1 to n If ( a_i < T ), count := count + 1 End-for Return( count )

(a) Characterize the asymptotic growth of the worst-case time complexity of the algorithm. Justify your answer.