In Big- notation, analyze the running time of the following pieces of code/pseudo-code. Describe the running time as a function of the input size func(0, n); void func(int curr, int n) { if (n <= 0) return; if (curr <= 0) func(n-1, n-1); else func(curr-1, n); }