Suppose your algorithm for sorting an array is to divide it in half, perform selection sort on each half, and then merge the two halves together. What can be said about the performance of this algorithm for large arrays?

Question $26$Select one:

a$.$

The algorithm is the same order as the selection sort

b$.$

The algorithm is the same order as the merge sort

c$.$

The algorithm performs as the average of the two sorts

d$.$

The algorithm is slower than either of the two sorts by themselves