Mark all statements that are true. The worst case, average case and best case time performance of mergesort is O(NlogN) when N is the number of elements in the array. The performance of the remove operation in a binary search tree is O(N) in the worst case ( N is the number of nodes in the tree). It is always more efficient to sort an array of values and then perform a binary search, than to perform a linear search. The minimum number of leaves in a binary heap with four levels is 4 . The actual running time of an algorithm with the performance of O(N) is always slower than the actual running time of an algorithm with the performance of O(logN). The height of a binary heap is always O(logN) where N is the number of nodes in the tree. The bubble sort and quicksort have the same worst-case time performance. The selection sort and heap sort have the same worst-case time performance. We add the following values one by by to an initially empty max-heap: 35,20,17,26,10,41,5,23. What is the level-order traversal of the tree representing this heap? (Enter the values separated by a comma and a single space.) A When we remove one element from this max-heap, what is the value of the right child of the new root? (Enter a single number.) A When we remove one element from the original' max-heap, what is the value of the left child of the new root? (Enter a single number.) When we remove two elements from the original max-heap, what are the values stored in the lowest level from left to right. (Enter the values separated by commas and a single space.) 4