What is the main advantage of using a binary search algorithm to search for an element in a linked list?A$.$ It has a lower runtime complexity in the worst$-$case scenario.B$.$ It has a lower runtime complexity in the best$-$case scenario.C$.$ It has a lower space complexity.D$.$ It is faster for large linked lists.