Use Big-O notation to analyze the running time of the following functions in terms of n. Show intermediate results so that you can get partial credits. a. void sort (int a[l, int n) for (int i = 0; i alj]) int temp = a[i]; a[i] = a[j]; b. int sum (int n) int val-0 for i=1; il jj/2) val +-i*j; return val; c. int search (int target, int a, int n) int pos-0 while (pos n) if (a[pos]target) return pos pos+t if (pos ) return -1<>