We have two procedures above. Why is Search2 better than the procedure of Search1?

Choose one.

A. It has less iterations with returning sucessful search

B. Faster in finding search key

C. It has less iterations with returning unsuccesful search

D. It will surely terminate

E. It does less number of comparisons

procedure LINEAR_SEARCH_2(T, K) 1 2 3 4 6 7 8 KEY(n + 1) - K loop if K = KEY (i) then exit i+1 forever if i <>