I am having trouble to find the specific information about Dijkstra agorithm and Shortest Path techniques for my following two problems. Please help me by providing either specific answer or URL for my questions. I appreciate your help.
 What is the running time of Dijkstra’s algorithm if the min-priority queue is implemented using a sorted array. I need to prove the answer by giving an example.
 Dijkstra’s algorithm can be easily modified to work on undirected graphs. Let T be a tree of shortest paths constructed by the modified algorithm for an undirected, connected, weighted graph G with positive weights.
1. True or false: T is a spanning tree of G? If it is true, give a proof. If it is false, give a counterexample.
2. True or false: T is a minimum spanning tree of G? If it is true, give a proof. If it is false, give a counterexample.
Thanks in advacne for all input.