Please explain clearly with steps. thanks

What is the optimal worst-case big-O for the following priority queue operations? (a) dequeue() when stored as an unsorted list: (b) enqueue() when stored as a sorted list: (c) peek() when stored as a sorted list: Answers: 0(1) O(1) Amortized O(log n) O(n) O(n log n) O(n^2) worse than O(n^2)