Algorithms, Data Structures and Computability

quickly plz

b) Consider the following function: (6 marks] . def f(n) { if n == 0: return 1 else return (F(n-1) + Process(n)) Given that the complexity of Process(n) function is O(n) 1) Derive the number of arithmetic operation T(n) done by the function F(n) [2 marks] 2) Use the appropriate method to derive the complexity of the function F(n) [4 marks]