Assume you have a list of 100 elements, in the first call of the algorithm how many potential candidates are there for the first element of the sorted list? \begin{tabular}{c} 99 \\ \hline 100 \\ \hline 50 \\ \hline 101 \\ \hline 98 \end{tabular} Question 10 Which of the following lines of code prevents the algorithm from choosing already explored candidate values twice? Sorted_list[index] = next_value; Potential_values = copy(unsorted_list) Next_value = Choose_Random_Element(potential_values); Potential_values = get_larger_unused_values(sorted_list, unsorted_list, index); Potential_Values.Remove(next_value); Assume you are using a backtracking algorithm to search for the node 40 in the max heap represented by the array 100,50,60,40,10,20,30. Assuming that you search from the root of the heap downwards recursively, which of the following is a valid order in which the nodes could have been first visited? \begin{tabular}{l} \hline 100,60,30,20,10,40 \\ \hline 100,50,60,10,30,40 \\ \hline 100,60,30,20,50,10,40 \\ \hline 100,60,50,30,20,10,40 \\ \hline 30,20,10,40 \end{tabular} Question 12 1 pts Assume you are using a backtracking algorithm to search for the node 40 in the max heap represented by the array 100,50,60,40,10,20,30. What is the minimum number of nodes that must be searched in order to find the node 30 ? 3 4 6 5 1