1. (5 pts each) For each of the following code snippets, find the asymptotic running time in terms of . Justify your answrer as we did in class: find an expression for theing 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) Func4in) s=0 for i 1 to n2 do s=0 for i = i to n2 do for j = 1 to n2 do s=s+i+) for j _ 1 todo for k 21to n do returns (b) Func2(n) return s 1 to n) do for j = l to 12 do for i (e) Func5(n) for i: 1 to n2 do returnS while (j<>