I have a problem that tells me that I have an array of N comparable elements and an array b that is circular from a. And it asks me to design a generic function in Java that receives a circular array b of comparable elements and a t value of generic type and that returns if t exists in b and asks me for the algorithm to be in time O (logn). Is there any way to use a quicksort algorithm but modified to give me a time O (logn)? Ex: fix to [] = {1,2,3,5,6,8,9,34,55,89} fix b [] = {34,55,89,1,2,3,5,6,8,9}