Given the following function:

Examine the running time of the algorithm.

1. (40 pts) Given the following function: void sort (int arr [] , int n) { int i, key, j; for (i= 1; i n; i++ Key - arr1 while (j =0&& arr[j] key ) { arr [j+1] - arr [j] arr [j +1] - key; (a) Examine the running time of the algorithm (big-O) (b) Use the function to sort the following input array. Show all the steps. 9 45862 1. (40 pts) Given the following function: void sort (int arr [] , int n) { int i, key, j; for (i= 1; i n; i++ Key - arr1 while (j =0&& arr[j] key ) { arr [j+1] - arr [j] arr [j +1] - key; (a) Examine the running time of the algorithm (big-O) (b) Use the function to sort the following input array. Show all the steps. 9 45862