If you can explain, it would be great!

1. Analyze the running time of insertion sort on an array of size n Show detailed analysis of the steps and express the final answer using order notation. void insertionSort(int[] arr) 1 // sort arr[o..arr.length-1]- for ( int i-l; i-0 &&arr[j] > key) 1 arr j+1]-key