Assume a hash table is implemented using chaining with buckets implemented using sorted linked lists. What's the worstcase time complexity of inserting a data item? $(n$ is the size of data$)$

$$ None of these

O$($nLog$($n$))$

$O(n^2)$

$O(n)$

$O(1)$