Incorrect 0/0.33 pts You search for value 30 in the following 2-3 tree. How many key values in the tree does the value being searched get compared against? Assume that nodes with two keys are organized as they were in the video. (Note, other than the value being searched, all questions are identical.) 15 10 20,30 2,4 11 16 22,26 35 4 Incorrect Question6 0/0.33 pts You search for value 17 in the following 2-3 tree. How many key values in the tree does the value being searched get compared against? Assume that nodes with two keys are organized as they were in the video. (Note, other than the value being searched, all questions are identical.) 15 10 20,30 2,4 11 16 22,26 35 Incorrect Question 7 0/0.34 pts You search for value 21 in the following 2-3 tree. How many key values in the tree does the value being searched get compared against? Assume that nodes with two keys are organized as they were in the video. (Note, other than the value being searched, all questions are identical.) 15 10 20,30 2,4 11 16 22,26 35 Incorrect Question 2 0/0.33 pts You search for value 3 in the following 2-3 tree. How many key values in the tree does the value being searched get compared against? Assume that nodes with two keys are organized as they were in the video. (Note, other than the value being searched, all questions are identical.) 15 10 20,30 2,4 11 16 22,26 35 Incorrect Question 3 0/0.33 pts You search for value 5 in the following 2-3 tree. How many key values in the tree does the value being searched get compared against? Assume that nodes with two keys are organized as they were in the video. (Note, other than the value being searched, all questions are identical.) 15 10 20,30 2,4 11 16 22,26 35 Incorrect Question4 0/0.34 pts You search for value 20 in the following 2-3 tree. How many key values in the tree does the value being searched get compared against? Assume that nodes with two keys are organized as they were in the video. (Note, other than the value being searched, all questions are identical.) 15 10 20,30 2,4 11 16 22,26 35 Partial Question 6 0.15/1.5 pts In the final tree, some values are alone within a node of the tree, and some are in pairs. If a value is in a pair, tell which value it is paired with. Otherwise, select "alone". 0 alone 3 4 0 2 Incorrect Question5 0/0.5 pts After the first double split, what value is in the left subtree of the root? 3 4 0 2 Incorrect Question 3 0/0.5 pts What is the first value inserted which causes two nodes to split (a cascaded split)? 0 2 3 4 7 Incorrect Question 1 0/0.5 pts What is the first value inserted which causes a node to split? 0 2 3 4 8 Incorrect Question 4 0/0.2 pts In Binary Search Trees, if we decide to allow duplicates, we insert into the right subtree of a node with a duplicate to the one being inserted, instead of the left. Why is this? induction hypothesis damage control stability We don't (trick question) arbitrary preference runtime efficiency space efficiency We simply dislike the left. It smells bad, like hippies in a drum circle on a hot day depth control recursion Incorrect Question 2 0/0.4 pts You are given the following Binary Search Tree. You delete the 4 value at the root. What is the new value at the root? 4 0 36 9 4 6 8 The root is empty 0 3