Correct Option: D
Binary search using a linked list is not efficient as it will not give $O(\log n)$, because we will not be able to find the mid in constant time. Finding mid in linked list takes $O(n)$ time.
Recursive programs are not efficient because they take a lot of space, Recursive methods will often throw Stack Overflow Exception while processing big sets. moreover, it has its own advantages too.