Correct Answer is : 0 (n)
Explanation: The complexity of the linear search algorithm is O(n). This is because linear search runs in linear time and makes a maximum of n comparisons, where n is the length of the list. The running time increases, at most, linearly with the size of the items present in the list
