Question $1$

$5$ pts

Consider the following table?

Algorithms

$($P$)$ Dijkastra's Algorithm

$($Q$)$ Merge Sort

$($R$)$ Fibonacci numbers

Design Paradigms

$($i$)$ Divide and Conquer

$($ii$)$ Greedy

$($iii$)$ Dynamic Programming

Which option follows the proper mapping?

P$-($ii$),$ Q$-($iii$),$ R$-($i$)$

P$-($ii$),$ Q$-($ii$),$ R$-($iii$)$

P$-($iii$),$ Q$-($i$),$ R$-($ii$)$

P$-($ii$),$ Q$-($i$),$ R$-($iii$)$