Implement a Stack using Queues

Question Explain

Implement a Last-In-First-Out (LIFO) stack using only two queues. The stack should support `push`, `top`, `pop`, and `empty` operations.