Consider procedure list search (L, K) to find the first element with key K in list L by simple linear search, returning pointer to its element. Arrange the correct order. 

(A) $x = L.Head$ 

(B) while $x \ne Nil$ and $x.key \ne K$ 

(C) return $x$ 

(D) $x = x.next$ 

Options 

(a) A, B, D, C 

(b) B, C, D, A 

(c) A, D, B, C 

(d) A, B, C, D