The given diagram shows the flowchart for a recursive function A(n). Assume that all statements, except for the recursive calls, have 0(1) time complexity. If the worst-case time complexity of this...

None

Extracted text: The given diagram shows the flowchart for a recursive function A(n). Assume that all statements, except for the recursive calls, have 0(1) time complexity. If the worst-case time complexity of this function is O(nª), then the least possible (accurate up to two decimal position) of a is Flowchart for Recursive Function A(n) Start A(n/2) Return A(n/2) A(n/2)-A(n/2) Return A(n/2) Return A(n/2) Return