.The time required to search an elementin a linked list of length n is

A

$$O(\log_{2}n)$$

B

O(n)

C

O(1)

D

$$O(n^{2})$$