A set is a container that stores a collection of sorted unique elements. When we use a sorted array to implement Set ADT, the time complexity of find$($x$),$ insert$($x$)$ and remove$($x$)$ are all O$($logn$).$

Group of answer choices

True

False