true or false?

Given an array already in sorted order, Bubble Sort runs asymptotically faster than Merge Sort.

Given an array already in sorted order, Merge Sort runs asymptotically faster than Insertion Sort.

The time complexity of Selection Sort remains the same for any sequence, regardless of the original order of the input data.

Given an array of random integers between $1$ and $100,$ the running time of Bucket Sort will always be the same as that of Counting Sort, regardless of the number of buckets used.