Analysis of the linear search algorithm: the count must be performed per line, the count must be presented in table form. Consider the worst case. Arrive at the characteristic function and asymptotic complexity in Big$-$O notation.