1. (5 pts each) For each of the following code snippets, find the asymptotic Justify your answer as we did in class: find running time in terms of . an expression for the running time as a function of n, then find a valid upper and lower bound which differ by only a constant factor. (a) Func1(n) (d) Func4(n) s=0 for i 1 to n do for i 1 to n do for j 1 to n2 do for j 1 to n do s=s+1+5 for k n1 to n3 do return s (b) Func2(n) return s for i 1 to n do (e) Func5(n) for j 1 to i do for i 1 to n do returns while (j