Question
For any directed graph with 10 vertices, what is the maximum possible number of edges in the shortest path between any two vertices?
The response must be typed, single spaced, must be in times new roman font (size 12) and must follow the APA format.