Consider the following code. What does the function xyz do$?$

void xyz$($int n$)$

$\{$

IntQueue q $=$ new IntQueue$()$;

q$.$enqueue$(0)$;

q$.$enqueue$(1)$;

for $($int i $=0$; i $<$ n; i$++)$

$\{$

 int m $=$ q$.$dequeue$()$;

 int n $=$ q$.$dequeue$()$;

 q$.$enqueue$لا$;

 q$.$enqueue$($m $+$ n$)$;

 print$($m$)$;

$\}$

Prints first n Fibonacci numbers in reverse order

Prints First n Fibonacci Numbers

Prints number $0$ to n$-1$

Prints numbers from n$-1$ to $0$