<Li> Increase i by 1 and go to step 2 . </Li> <Li> If L = T, the search terminates successfully; return i . Else, the search terminates unsuccessfully . </Li> <P> For a list with n items, the best case is when the value is equal to the first element of the list, in which case only one comparison is needed . The worst case is when the value is not in the list (or occurs only once at the end of the list), in which case n comparisons are needed . </P> <P> If the value being sought occurs k times in the list, and all orderings of the list are equally likely, the expected number of comparisons is </P>

When does the worst case occur in a linear search algorithm
find me the text answering this question