C++ language

Jump to level 1 Given list: {929344571737892} Which list elements will be checked to find the value: 73 using binary search? Ex: 42, 32, 12 73 using linear search? 9 using binary search? 9 using linear search? Which search method is faster to find 73 ? Select v Which search method is faster to find 9 ? Select \begin{tabular}{|l|l|l|l|l|} \hline 1 & 2 & 3 & 4 & 5 \\ \hline \end{tabular} Check Next Jump to level 1 numbers ={112889835093883716} Partition(numbers, 1,8) is called. Assume quicksort always chooses the element at the midpoint as the pivot. What is the pivot? What is the low partition? {} What is the high partition? \} What is numbers after Partition(numbers, 1, 8) completes? \{ \}