In a linear search, the worst-case scenario occurs when the target item is **** or not in the list.

In a linear search, the average time complexity is **** of O(n), where n is the number of items in the list.

In a linear search, the items are checked **** until the target item is found.

Linear search can be easily implemented using a **** loop to iterate through the items in the list.