3. For each of the following algorithms, analyze the worst-case running time. You should give your answer in big-Oh notation. You do not need to give an input which achieves your worst-case bound, but you should try to give as tight a bound as possible. Justify your answer (show your work). This likely means discussing the number of atomic operations in each line, and how many times it runs, writing out a formal summation for the runtime complexity T(n) of each algorithm, and then simplifying your summation. (c) Here, abs (n) returns the absolute value of its argument, and can be treated as an atomic operation 1 h(A): // A is a list of integers, of length at least 2, first index is 1 2 min = abs(A[1] - A[2]) 3 for i = 1 to len(A): 4 for j = i+1 to len(A): if abs (A[i] - A[j])