Suppose you insert() an item into a hashtable and then immediately do a lookup() on that item as the methods shown below. What is the worst-case complexity of the program in this situation? Briefly explain the answer please. Thanks!

public void insert(T item) { int initSize = tableSize; if (hashTable == null) { throw new NullPointerException(); // hash index int hashIndex = hashTable.hashCode() % initSize; if (hashIndex (); hashTable[hashIndex]. add(item); } else { hashTable[hashIndex].add(item); // increment number of items in the list numItems++; // check is the size of table is enough, resize if needed if (double) (numitems / initSize) > loadFactor || (hashTable[hashIndex]).size() + 1 > maxChainLength && maxChainLength > 1) { // resize tableSize = initSize * 2 + 1; // new table with new size newTable = (LinkedList[] (new LinkedList[tableSize]); // go through all items in old table for (LinkedList 1 : hashTable) {