What are the write answers and include the steps or definitions how you solve them?

Using a while loop with one statement in its body put all elements of a queue (Q) inside a stack (S) [the last element of the queue should be in the top of the stack]. You are allowed to use any required stack's and/or queue's operation. Please visualize recursion trace for the call LinearFibonacci(6) for the following algorithm: F_0 = 0 F_1 = 1 F_i = F_i - 1 + F_i - 2 for i > 1 Algorithm LinearFibonacci(k): Input: A nonnegative integer k Output: Pair of Fibonacci numbers (F_k, F_k - 1) if k = l then return (k,0) else (i, j) = LinearFibonacci(k - 1) return (i + j, i)