finding the kth smallest element in an unsorted array. The question asks which of the following statements is true:The best running time in finding kth smallest isO$($logn$)$O$($logn$)$as we can use recursion.The best running time in finding kth smallest isO$($n$)$O$($n$).$First, we can sort it and then find the kth position. That will takeO$($nlogn$)$O$($nlogn$)$time in the best case.The best running time in finding kth smallest isO$(1)$O$(1)$as we find only the kth smallest.