Given a sorted list of 32 elements, how many distinct list elements are compared for binary search if the search key is less than all elements in the list? Ex: 42

write basic python code adn create a list  list_append: adds a new element to the end of the list. then print

True or false: Merge sort can be implemented using O(1) auxiliary space.

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