A) O(logN) -> Binary Search. No other option Matches -> R . Option C & D eliminated.
C) O(nlogn) => Merge sort, even in best worst or any case. -> S Option A eliminated.
It seems to me that all options are wrong here. But I would go with
Option B) A-R B-P C-S D-Q
D => Q This is okay.
B=> P It is okay if we just have selection. Selection sort is O(N^{2})