Description Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack (push, top, pop, and empty).

A PriorityQueue is a list that always keeps its items sorted based on some rule, like smallest to largest. So, when you take an item out, you always get the one with the highest (or lowest) priority.

Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack (push, top, pop, and empty).