option d
a) merge ------------------------------------.> iii) Divide and conquer
b) Huffman coding -------------------------> ii)Greedy approach
c)Optimal polygon triangulation -------->i) Dynamic programming
d)Subset sum problem------------------->iv)Backtracking
- optimal polygon triangulation is similar to matrix chain multiplication.
- we will solve the Subset Sum problem using a backtracking as well as dynamic prog.
so the best matching is option d