madeeasy test series

Question

Consider the following statements:

S₁ : Implementation of stack using queue, deletion of second element from top of stack time complexity Ο(n), when insertion take Ο(1) time.
S₂ : In implementation of queue using stack, deletion of second element from front take Ο(1) time, when insertion take Ο(n) time.which one of the true?

please explain s2 if anyone finds it true.

Comments

https://leetcode.com/articles/implement-queue-using-stacks/

Second statement is true 

see in the above link!