Find asymptotic running time , find expression for the running time as a function of n, then find valid upper and lower bound which differ by only a constant factor

(d) Func4(n) for 1 to 2 do for j 1 to n do s +i+ j 3 do for K n2 1 to n s i -t j return s (e) Func5(n) for i 1 to n2 do while k n) do for k 1 to j do s -t i+j return s (f) Func6(n) for to do while (j ii) do s t i t j return s