what manner is a state-space tree for a backtracking algorithm constructed Nearest neighbour first Twice around the tree Depth-first search Breadth-first search Question 6 1pt Assume you have the following backtracking based sorting algorithm: bool Backtracking_Sort(sorted_list, unsorted_list, index, length) \{ if (index == length) \{ return true; \} Potential_values = []; If (index != 0)\{ Potential_values = get_larger_unused_values(sorted_list, unsorted_list, index); \} else \{ Potential_values = copy(unsorted_list); While(NotEmpty(potential_values) \{ Next_value = Choose_Random_Element(potential_values); Sorted_list[index] = next_value; If(Backtracking_Sort(sorted_list, unsorted_list, index +1, length) = = true)\{ Return true; Potential_Values.Remove(next_value); \} return false; \} 3 Assume that you have an array of length 20 , what is the base case for this recursive algorithm? When Index =10 When Index =21 When Index =19 When Index ==20 When Index ==0 What is the "dead end" condition in this algorithm which forces the backtrack? When NotEmpty(potential_values) is false When index == length When Index !=0 When NotEmpty(potential_values) is true When Index ==0 Question 8 1pts Assume you have the unsorted list [10,3,9,5,8] and have a partially created sorted list equal to [3, 8] index ==2, what are the potential values for the next value in the sorted list? 9 10 10,9,5,8 9,10 5,3,8