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. (f) Func6(n) (i) Func9(n) s 0 for i 1 to n do s=0 for i = 1 to n/2 do for j - i to i do while (i 3) do return S return s (h) Func8(n) s 0 for i 1 to n do i to n2 do for k j to n3 do for j s=s+i+) returnS