first u have to search an element in array logn binary search + for deletion O(n) (worst case ) bcz u have to shift the element in array so O(logn)+O(n)=O(n)

worst case will be O(logn) soanswer will be C apply master theorem