What are the time complexity of the enqueue, dequeue, and getSize methods in MyPriorityQueue?

Hello, i need help with understanding Big-O.   What is the execution time Big-O for each of the methods in the Queue-1.java interface for the  ArrayQueue-1.java  and   CircularArrayQueue-1.java implementations? Short Big-O reminders: Big-O is a measure of the worst case performance (in this case execution time). O(1) is constant time (simple assignment statements) O(n) is a loop that iterates over all of the elements. O(n2) is one loop nested in another loop, each of which iterates over all the elements. If a method calls another method, what happens in the called method must be taken into consideration. Queue.java public interface Queue<E> {    /**      * The element enters the queue at the rear.      */    public void enter(E element);     /**      * The front element leaves the queue and is returned.      * @throws java.util.NoSuchElementException if queue is empty.      */    public E leave();     /**      * Returns True if the queue is empty.      */    public boolean…

For a weighted graph, each edge is an instance of WeightedEdge.    a. WeightedEdge is an interface that must be implemented differently depending on the data type of the weights on the edges.   b. WeightedEdge is a subtype of Edge.   c. WeightedEdge implements the Edge interface.   d. WeightedEdge is a subclass of AbstractEdge.

The nodes of the strongest linkedlist are undetermined.Is one especially lengthy?