Running Time (in Big "Oh" notation) for stacks and queues

The goal for this exercise is to continue to review the Big “Oh” notation

            Take the queue of integers, and the stack of integers that you've implemented, and annotate each method listed below, put a comment immediately before the start of each method describing the running time of that method, using the Big "Oh" notation  Make sure to include a quick (1-2 sentence) explanation as to why you chose the running time that you did. You should do this exercise, based on your code, even if you can't get all the methods to work correctly.

What you need to do for this exercise:  

1.  Within your Stack class, you should have a note beside the isEmpty, Peek, Push and Pop methods.
2.  Within your Queue class, you should have a note beside the isEmpty, Peek, Enqueue and Dequeue methods
3.  These notes should be left in the source code for the appropriate classes, as described above.  These classes should be found in the Student_Answers.cs file in a project named something like 03_PCE_StudentCode.