Let size of queue n and it is full filled.
Then function f(queue Q) will be called n times and every function call having a local variable i. (Untill last function call i.e. queue is empty all i variable should preserved).
So total n function call we need n local variable i.
Additional storage is not constant. It is order of n.