Which of the following scenarios will consistently cause binary search (given search value x and list lst) to exhibit the poorest runtime complexity?

(a) x is the least common value in lst (i.e., fewest duplicates)

(b) lst contains duplicates of x

(c) x is the middle element of lst

(d) x is not found in lst