Explain pls

Which big-oh expression best characterizes the worst case time complexity of the following implementation of knin? *Returns the kth smallest element in an aTTay of unique values public Comparable kmin(Comparable[] a, int k) java.util.Arrays.sort (a); return a[k - 1] B. O(N) C. O(N log N) D. O(N2)