$($d$)$ calculate the average shortest path length from the selected node to all other nodes.

Hints:

$-$ Function randint$($a$,$b$)$ in random package generates a random integer between $($and

including$)$ two integers a and b

$-$ Function has$\_$path$($G$,$i$,$j$)$ returns true if there is at least one path from node i to node

j in graph instance G; otherwise, it returns false.