You need to implement a Queue (FIFO) using only Stacks (LIFO).
Queue operations:
push(x) → add to back
pop() → remove from front
peek() → view front
empty() → check if empty
⚠️ Constraint:
You can only use stack operations (push, pop, peek from top).
