Question # 1 of 10 ( Start time: 11:09:54 AM )Total Marks: 1What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm?Select correct option:log (V)V.VE.Elog (E)Question # 2 of 10 ( Start time: 11:11:24 AM )Total Marks: 1A digraph is strongly connected under what condition?Select correct option:A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v .pair of vertices u, v e V, u can reach v and vice versa.A digraph is strongly connected if for at least one pair of vertex u, v e V, u can reach v and vice versa.pair of vertices u, v e V, u can reach...