Match the following algorithm with its times complexity. a. Prim's algorithm i. O (V^3) b. Dijkstra algorithm ii. O (V^2) c. Floyd-Warshall algorithm d. BFS algorithm Select the correct Options: A. i, ii, iv, iii B. iv, ii, i, iii C. iii, iv, ii, i D. iv, ii, iii, i iii. O (E iv. O (E + V) log (V) )

vi) What will the time complexity of a algorithm if the program takes 0.1 msec to execute when N = 10000 and 0.4msec when N = 20000. a. O(N) b. O(log N) c. O(N²) d. O(N log N)

Question 5 : Consider the following algorithm 1. count := 0 2. for i := 1 to n 3. for j:=i to i+5 4. for k := 1 to i? 5. count := count +1 a) How many times step 5 is executed? (You must show your steps) b) What is the time complexity of the algorithm in O-notation?

Question)   Given their time complexity, which of the following algorithms will be the fastest? O(N logN) O(logN) O(√N) O(N)

Computer science