To find out the fastest execution for a given upper bound , just check the behaviour of the functions(upper bound) for large values of N....the lower the value, faster the execution
Here in this case its obvious that logn < n^1/2 for large values of N as you can check from their graph too..and therefore logn < n (obvious) so logn - c is correct option