Q11a

Consider the following algorithms. Assume, procedure $A$ and procedure $B$ take $O (1)$ and $O(1/n)$ unit of time respectively. Derive the time complexity of the algorithm in $O$-notation. algorithm what (n) begin if n = 1 then call A else begin what (n-1); call B(n) end end.