InPrim’s algorithm, if we do not use the min-priority queue and store all the key values in an array, what will be the running time of the modified algorithm?
