Find the running time for each of the following algorithms. Show work by

finding a table of values for each while loop, writing the summations, then

solving. When using upper and lower bounds the bounds should differ by only a

constant factor. Justify your solution.

b) Func6(n) while (i 8) do 4 s si - j; end 10 end 11 return (s)