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.

1. Consider the algorithm:procedure giaithuat(a1, a2, …, an : integers)count:= 0for i:= i to n doif ai > 0 then count: = count + 1print(count)Give the best big-O complexity for the algorithm above

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

If the efficiency of the algorithm doIt can be expressed as O(n) = n2 , cal-culate the efficiency of the following program segment:for (i = 1; i <= n;; i++)for (j = 1; j < n, j++)doIt (...)

What is the time complexity of this function / algorithm?void f(unsigned int n){ int i; for (i = 1; i < n; i = i * 2) { printf("[%d]\n", i); }}O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))

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;}