8. If Djjkstra algorithm is implem ented with Fibonacci heap as priority queue, then the con (A)O(IV|2+|E|log|V|)(B)O(|V|2) (C)O(|E|log|V|) (D)O(|E|+|VILog|VI) (E)O(|E|)

Please choose the best possible answer in each of the following questions. In questions that ask for time complexities, please choose the tightest bound. 1. Consider the following five recursive functions: (A)(B) (C)(D)(E) Which recursion yields the highest asymptotic complexity for T(n)?