Suppose you have an array with $P$ randomized values. What is the cost of removing each value from the end of the array and inserting each of those into a lly empty binary search tree?

$O(1)$

O$($Log P$)$

$O(P)$

$O(PlogP)$

$O(P^2)$

$O(2^P)$