Question $1(4$ points$)$

Given an array already in sorted order, determine the running time of the following

sorting algortihms.

Merge Sort

$(n)$

Insertion Sort

$(nlogn)$

Bubble Sort

$(n^2)$

Selection Sort