Give the correct matching for the following pairs:

Group - 1

(A) $${\rm O}(\log n)$$
(B) $${\rm O}(n)$$
(C) $${\rm O}(n\log n)$$
(D) $${\rm O}({n^2})$$

Group - 2

(P) Selection
(Q) Insertion sort
(R) Binary search
(S) Merge sort

Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?

Type checking is normally done during

Which of the following statements is true?