How many item/key comparisons will the standard merge function (from merge sort) take to merge the left and right lists given below? left = [1, 3, 4, 6, 8, 10, 12, 14, 15] right = [1, 3, 6, 8, 12, 15, 19]

True or False  For each statement below, indicate whether you think it is True or False. If you like, you can provide a description of your answer for partial credit in case you are incorrect. 4) Delete is O(1) in the worst case because there is no shift after removing the node 5) Update is O(n) because it needs to perform a search for the element in the list 6) In the delete algorithm, the “previous” node reference is needed in case the element is not found in the list

Assuming the following list declaration, which element is at the position 0 after the first iteration of selection sort (Assume list is to be sorted in ascending order)? int list [] = {34, 56, 12, 25, 73, 4, 85, 13, 46, 16}; O None of these O 85 O 56 O 16

What is the worstSpace(n) of Radix Sort?