In Prim’s algorithm, the additional information maintained by the algorithm is the length of the shortest edge from vertex v to points already in the tree?

(A) True
(B) False
(C) NA
(D) NA