Problem 1 State the running time of the following Circular Linked List class methods in big-O notation. 29 30 31 // update methods public void rotate) { if (tail != null) tail-tail.getNext(); // rotate the first element to the back of the list // if empty, do nothing // the old head becomes the new tail public void addFirst (E e) { // adds element e to the front of the list if (size 0){ tail = new Node(e, null); tail.setNext(tail): // link to itself circularly } else { Node newest-new Node (e, tail.getNext(): tail.setNext(newest): size++; 43 )