Let’s assume we define a graph where we have weights on the vertices and not the edges. Is the shortest-paths problem applicable for this kind of graph? If so, give a precise and formal description of the problem. If not, explain why not. Note we are not asking for an algorithm, just what the problem is or that it makes no sense. Give a small example depicting a graph.