6. For each of the following algorithms, give the asymptotic running time in notation. Justify your answer. (Show your work.) Be sure to justify both LOWER and UPPER bounds. (a) func1(n) 150; 2 for itn to [n? ] do 3 for jt 13 to [1/2] do 4 sts+i- j; 5 end 6 end 7 return (s); (b) func2(n) 15+0; 2 for it 5 to [n2/2] do 3 j+5; while j