Looking at the following algorithm, please give an analysis of it in terms of time complexity using mathematics and put it in big O notation!   Algorithm A:   k := 0   For i = 1 to n:         For j = (i + 1) to n:               k = k + j + i   Return k If possible, please analyze it simply as I have trouble understanding the loop processes.

Q3. Compute the complexity (O-big notation) of the following algorithms and explain the result mathematically. a. while (n> 1) { if (ODD(n)) //function ODD(n) of constant complexity that returns true if n is odd, // otherwise returns false i = 3 * n + 1; else for (i=1;i

Consider the following three sorting algorithms: Insertion Sort, Heapsort, and Quicksort. Here are three statements. A. Iam an incredibly fast sorting algorithm that runs in O(n log n) time on average, though my worst case run time is O(n2). B. I run very quickly for small values of n, but unfortunately am really slow when n is large. My average run time is O(n2). C. I am an in-place sorting algorithm whose average case and worst case running time is O(n log n). For each statement (A, B, C), determine the correct sorting algorithm.