2)Determine the number of operations for each problem and write the order of ope

2)Determine the number of operations for each problem and write the order of operations using big-O notation O(h) :
a. sum(x); % Iterative algorithm where x has n values.
b. fibI(n); % Iterative algorithm where n is the n-th Fibonacci number.
c. factorial(n); % Iterative algorithm where the return value is n!.
d. How many operations are needed to compute the slope m in problem 10 above?
e. for ( k=1 : 1 : n )
a(k) = b(k)*sqrt(b(k))-c*a(k);
endf. for ( k=1 : 2 : n ) % n is always odd.
x = 3*d(k) + b(k);
for ( h=1 : 1 : m )
b(k) = b(k) + a(kh)*c(h);
end
endg. for ( k=1 : 1 : n )
for ( h=1 : 1 : k )
b(k) = x*b(k) + a(kh)*c(h);
end
endh. for ( k=1 : n )
for ( h=1 : m )
for ( a=1 : p )
b(kha) = 2*b(kha) + c(kha);
end
end
endi. The following code fragment is O(h^3/2 log^2 base 2(h))
for ( k=1 : sqrt(n) )
for ( h=1 : m )
B = myAlogorithm( A n m )
end
end
What is the big-O order for the function myAlogorithm