Question: Match the following algorithm with its times complexity.a$.$ Activity selection Problemb. Huffman codes C$.$ Optimal polygon triangulationd....

Match the following algorithm with its times complexity.

a$.$ Activity selection Problem

b$.$ Huffiman codes

c$.$ Optimal polygon triangulation

d$.$ Ouicksort algorithm

$o(V**3)$

$(V2)$

i$.o(n)$

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