Match the following algorithm with its times complexity.

a$.$ Activity selection Problem

b$.$ Huffman codes

C$.$ Optimal polygon triangulation

d$.$ Quicksort algorithm

i$.$ o$($V$^3)$

ii$.$ o$($V$^2)$

ii$.$ o$($n$)$

iv$.$ O$($n log$($n$))$