If you have a function that first sorts an array of size $N($with a time complexity of log $N)$ and then searches for an element in the sorted array using binary search $($with a time complexity of $),$ what would be the overall time complexity of the function?

$O(N+logN)$

$O(2^N)$

$O(N^2)$

$O(NlogN)$