Write a python code to

$($a$)$ generate a graph based on the instance shown in the figure;

$($b$)$ select one of the nodes randomly;

$($c$)$ determine the shortest paths from the selected node to all other nodes;

$($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 $($andincluding$)$ 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.

Please solve the questions above using networkx dictionary.

The needed graph is added as png in the below.