Consider a skip list with N items where N is large... let's say N > 1,000,000. If we do a find operation for an item, how likely is it that the operation will take the worst case times complexity?