Consider the following table:

Algorithms

Design Paradigms

(A) Huffman Coding

(I) Divide and Conquer

(B) Merge sort

(II) Greedy

(C) Coin change problem

(III) Dynamic Programming

Match the algorithms to the design paradigms they are based on.

(A) ↔ (I), (B) ↔ (II), (C) ↔ (III)

(A) ↔ (II), (B) ↔ (III), (C) ↔ (I)

(A) ↔ (III), (B) ↔ (I), (C) ↔ (II)

(A) ↔ (II), (B) ↔ (I), (C) ↔ (III)