Comparison of Algorithms

$\{$NONGRADED QUESTION NO $4\}$

Suppose you have an array arranged in descending order, and your aim is to sort this array in ascending order.

Which sorting algorithm will carry out the job in the best possible manner?

Note: Assume that you are only allowed to use either insertion, selection or bubble sort and consider their worst$-$ and best$-$case time complexities to answer the question.