Mark all statements that are true. The selection sort and heap sort have the same worst-case time performance. 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). The minimum number of leaves in a binary heap with four levels is 4. The bubble sort and quicksort have the same worst-case time performance. The height of a binary heap is always O(logN) where 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 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 worst case, average case and best case time performance of mergesort is O(NlogN) when N is the number of elements in the array