Explain and comment the C# code below line by line? Also, include running and space complexity for the code.

using System; using System.Collections;

namespace ProjectStQu { class Program { static void Main(string[] args) { Queue queue = new Queue(); Stack stack = new Stack();

Console.Write("Queue before reversing: "); for (int i = 1; i <= 6; i++) { Console.Write(i + " "); queue.Enqueue(i); } Console.WriteLine();

while (queue.Count != 0) { stack.Push(queue.Dequeue()); }

while (stack.Count != 0) { queue.Enqueue(stack.Pop()); }

Console.Write("Queue after reversing: "); while (queue.Count != 0) { Console.Write(queue.Dequeue() + " "); } Console.WriteLine(); } } }