How many steps are required for sorting the elements in a sequence of size n in ascending order using Insertion Sort?

Question $25$Select one:

a$.$

n$-2$

b$.$

n$-1$

c$.$

n

d$.$

depending on the order of the elements in the array