This is a GATE 2016 question. https://gateoverflow.in/39581/gate2016-2-39
From the flow chart, you can see that, In worst case, We will have to call $A(n/2)$ $Five$ times. And in best case, Just Two times.
So, For Worst case time complexity, Recursive equation would be as follows :
$T(n) = 5T(\frac{n}{2}) + 1$
Now, Just apply Master's theorem :
$T(n) = \Theta(n^{log_2 \,5})$ (In worst case)
Hence, $\alpha = log_2\,5 = 2.32$