$1.$ Analyze the running time of insertion sort on an array of size n$.$

Show a detailed analysis of the steps and express the final answer

using order notation. Assume all basic operations take unit time $($c $=1).$