Demonstrate the steps of the following algorithm by sorting the array:

[1, 4, 1, 2, 9, 5, 2].

Show that the worst case running time for the algorithm is T(n) = (n + M) and in the case where M = (n),

T(n) = (n).

ALGORITHM | Sort INPUT: datal] - array size n with max element M, .c. for 0i