Using big-O notation in terms of its parameter n, what is the running time of the below method in its worst case? Give the tightest and simplest bound possible, and justify your answer

Using big-O notation in terms of its parameter n, what is the running time of the below method in its worst case? Give the tightest and simplest bound possible, and justify your answer.public static int mystery(int n) {    int total = 0;    for (int i = 1; i < n; i *= 2) {        for (int j = i; j < 2 * i; j++) {            total += j;        }    }    return total;}

Consider the algorithm:procedure GT(n : positive integer)F:=1for i:= 1 to n doF: = F * iPrint(F)Give the best big-O complexity for the algorithm above.

Big O Notation

Time complexities of three algorithms are given. Which should execute the slowest for largevalues of N?(A) O(N^0.5)#(B) O(n)(C) O(logN)(D) O(log2n)(E)O(NlogN

What is the running time of the following code?(i.e., O(?))Sum = 0;for (i=0; i<n; i++){for (j=0; j < i; j++)++sum;}