1...........Keeps initially |V| sets; and merges two sets by adding an edge and decreases the sets by one

a.Kruskal's Algorithm

b.Prim's Algorithm

c.Dijkstra Algorithm

d.Activity Selection Algorithm

2. Which of the following is/are the operations performed by Dijkstra's algorithm

i) sort the edges of G in increasing order by weight ii) keeps a set of vertices S for which we have found the shortest path iii) keeps initially all vertices in a priority queue

a. i and ii only

b. ii and iii only

c. i and iii only

d. All i, ii and iii