Arrange the following in the increasing order of their asymptotic complexities.
(A) Insertion sort (best case)
(B) Bubble sort (worst case)
(C) Binary Search (worst case)
(D) Merge sort (worst case)
1
(A), (C), (B), (D)
2
(D), (A), (C), (B)
3
(A), (B), (C), (D)
4
(C), (A), (D), (B)