Can someone explain best and worst case scenarios (complexity) of insertion sort?

Question

Say we have a list of [1, 2, 3, 4, 5]. How do you calculate the worst or best case scenario?

I thought it was the amount of elements (5) squared, so 25 w