The average successful search time for sequential search on ‘n’ items is

• A. \(\frac{{\left( {n + 1} \right)}}{2}\)
• B. \(\frac{n}{2}\)
• C. \(\frac{{\left( {n - 1} \right)}}{2}\)
• D. log(n) + 1