Analyze the running time (i.e. T(n)) of these two functions as we did in class. You should be able to find some simple function f(n) such that T(n) = f(n)). You should fully prove your answer but you may use the same "shortcuts" I have demonstrated in lecture. (a) Func1(n) s=0 for i = 1 to n do for j = 1 to n do S = s+i+j returns (b) Func2(n) s=0 for i = 1 to na do for j = 1 to i do S=s+i+j returns