Given the following algorithm foo(n) if n - 1 return 1 else x- foo(n-1) for i - 1 to n x -x +i return x Determine the asymptotic running time. Assume that addition can be done in constant time. O (n) O(n) O (2") O O (n²)

9. Give a big-O estimate for the number of operations, where an operation is an addition or a multiplication, used in this segment of an algorithm.

Consider the following recursive algorithm, where // denotes integer division: 3//2 = 1, 5//2 = 2, etc. F(n):if n <= 1:    returnF(n//2)for i from 0 to n    for j from 0 to n//2        print(i+j)    Let function T(n) denote the running time of this algorithm. Derive T(n) and prove its worst case timecomplexity