What is the maximum number of edges that a shortest

What is the maximum number of edges that a shortest path between any two vertices in a graph with n vertices can have? Give a reason. In a complete graph with all edges of length 1?

PROBLEM SET 23.3: