COMPUTER SCIENCE MCQS: The given diagram shows the flowchart for a recursive function A(n). Assume that all statements, except for the recursive calls, have O(1) time complexity [G16S2Q49]