Could you please address those questions? I really appreciated

1, Find the computational complexity 0 (f) of each of the following algorithm with respect to n. Note that your answer should be tight bounds and not Big O(f). Function mystery 1(n): a = 0 for i = 1 to 2n: a += i for i = to 5n: a+=i return a Function mystery2(n): a= 0 for i = 1 to n: for j = 1 to 2n for k = 1 to n*n : a +=1 return a Function mystery3(n) a = 0 for i = 1 to n: b =1 while 2^b