Dijkstra's single Shortest Path algorithm is an example of following type of algorithm Divide and Conquer Dynamic Programming Greedy Other

The algorithm of Euclid computes the greatest common divisor (GCD) of two integer numbers a and b. The following pseudo-code is the original version of this algorithm.  Algorithm 1 Euclid1(a,b)Require: a, b > 0Ensure: a = GCD(a, b)    while a ̸= b do        if a > b then            a ← a − b        else            b ← b − a        end if    end whilereturn a We want to prove the correctness of this algorithm using the loop invariant technique. a. In a first attempt to prove the correctness of this algorithm, we propose the following loop invariant property: “GCD(a, b) is a factor of a and b”. Explain why this property willnot help you as is. b. Use your previous observation to propose another loop invariant property that willhelp you to prove the correctness of the version of Euclid’s algorithm presented above.  c. Show that your loop invariant property is true before executing the While loop forthe first time (i.e., initialization property)

Using Python

Question 15 What is the complexity of Dijkstra's Algorithm for shortest path? O(IEI) O 0(티 log |V) O O(I\V) O O(IVI log JEI)