Read the following code and determine what goes into blank #5 VertexT ShortestPath(GraphTypecVertexType> graph, VertexType startvertex) using namespace std, itemType is the type for items that are added to the priority queue It has 3 elds: VertexType toVertex, VertexType tromVertex, int distance // lt overloads the pq(10), N Assume at most 10 vertices. ypecVertexType vertexQ; VertexType vertex; graph.clearMarks)) Initialize the first item item.toVertex tem fromVertex item distance o; 11 #1 #2 cout