Write a function create$\_$spatial$\_$network $($itineraries$)$ that takes itineraries $($a list of tuples$)$ and returns for each location its neighbors and distances to them. A location is considered to be a neighbour of another location if it can be reached by a single road $($one edge$).$

Input:

itineraries: a list of tuples, where each tuple is of the form $($location$1,$ location$2,$ distance$).$ location$1$ and location$2$ are the string labels for these locations and distance is an integer.

Your function should return a list of tuples, where each tuple is of the form $($location$,$ neighbours$).$ neighbours should be of the form $[($neighbour $1,$ distance$1),($neighbour $2,$ distance$2),...]$ and be sorted by their distances $($in the increasing order$).$ If two or more neighbors have the same distance to the location, tie$-$break by alphanumeric order on their labels.

Note that in addition to the neighbors, the overall list has to be sorted.

You may assume:

Distances are non$-$negative integer values

Inputs are correctly formatted data structures and types

There are no duplicate entries itineraries, and in each neighbor pair only appear once $($i$.$e$.$ no $[(\text{'}$L$1\text{'},\text{'}$L$2\text{'},20),(\text{'}$L$2\text{'},\text{'}$L$1\text{'},20)])$

Here is a diagram of an example network:

For the network above, this would be a possible itineraries and the function should return the following:

$)$ create$\_$spatial$\_$network$($itineraries$)$

A different example $($not pictured$)$: