When seаrching а grаph using Dijkstra’s algоrithm, which оf the fоllowing are true for the priority value g(v) for a node v in the priority queue? Recall g(v) is the cost of the path from the start vertex to v. Assume that all edge weights are positive.