Domanda di colloquio di Amazon

The question on finding time-complexity of a recursive function was the hardest.