Select all statements that are true.

In the worst case the performance of insertion sort is the same as the performance of quicks sort.

The most efficient algorithm for finding pivot for partitioning steps in quick sort is to compute the median value of all the values in the array.

Merge sort runs faster than selection sort because it is recursive, and recursion is faster than loops.

After the first partition of quick sort is performed on an array of size $100,$ the pivot may be at the last index of the array.

One way to improve performance of repeated searches in a linked list is to sort the linked list and then apply the binary search algorithm $($to replace the slower linear search algorithm$).$