The following methods are commonly used in a dictionary implementation. What is the lowest time complexity achievable for each method: add(key, value) remove(key) getKeys() getValues() isEmpty() isFull() size() makeEmpty() Solution add (key,value) = O(1) remove (key) = O(1) getkeys() = O(log n) getvalues() = O(log n) isEmpty() = O(1) isFull() = O(1) size() = O(1) makeEmpty() = O(1).