Show how to implement First in First out with a priority Que

Show how to implement First in First out with a priority Queue. Show also how to implement a stack in a priority Queue. Answer in pseudo code please!|

Solution

2-

Method 1 This method makes sure that oldest entered element is always at the top of stack 1, so that deQueue operation just pops from stack1. To put the element at top of stack1, stack2 is used.