The element being searched for is not found in an array of 100 elements. What is the average number of comparisons needed in a sequential search to determine that the element is not there, if the elements are completely unordered?	Choose the correct choice from the following options:
A) 25 B) 50 C) 75 D) 100 E) 125

Rationale: let us assume k be the element we need to search then let array be n 1 , n 2 , n 3 . . . . . . . . . . . . . . n 100 now to prove that the element searched is not there in the array we have to compare the element k with every element in the array . so , totally we need 100 comparisons . answer : d
Answer: D