here nothing is given about the order in which the element to be inserted , we just have to take the data from the list and push it onto the stack...since both operations requires constant time O(1) would be the correct answer...
Note:if n elements are to be inserted then complexity would be O(n).