Suppose that a list of numbers contains values $(-4,-1,1,5,2,10,10,15,30].$ Which of the following best explains why a binary search should NOT be used to search for an item in this list?$($A$)$ The list contains both positive and negative elements.$($B$)$ The elements of the list are not sorted.$($C$)$ The is contains an odd number of elements.$($D$)$ The rist ontains duplicate elements.