1. Sort the growth of functions in ascending order and explain. 8logn,2n,7n/2,n 2. Calculate the running time of the codes in the below. Express your answer using the best possible asymptotical notation. Assume that t is a positive number and t>1. for i=2t;i1;i=i1 do for j=1;ji;j=j+1 do for k=1;kj;k=k+1 do k=kt; end for end for end for Algorithm 1: count =0; for i=2;in;i=i+1 do if i=0 then count = count +1 else i=2i; end if end for Algorithm 2: Assume the function pow (k,x) calculates xk. total =0 for k=5;kn;k=pow(k,x) do total = total +k; end for Algorithm 3