Linked lists are suitable for:
Insertion sort: No need to swap here just find appropriate place and join the link
Polynomial manipulation: Linked List is a natural solution for polynomial manipulation
Radix sort: Here we are putting digits according to same position(unit,tens) into buckets; which can be effectively handled by linked lists.
Not Suitable for:
Binary search: Because finding mid element itself takes $O(n)$ time.
So, Option B is answer.