GATE Computer Science (CS) 2016 Shift 2 Solved Paper

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. If the worst-case time complexity of this function is O(n^α), then the least possible (accurate up to two decimal position) of α is _______.