Write a function create$\_$social$\_$network$($traders$)$ that takes traders, a list of tuples specifing trader connections $($edges in the trader social network$)$ and returns a list containing $($trader$,$ direct$\_$connections$)$ for each trader in traders.

Input:

traders: a list of tuples specifing trader connections $($edges in the trader social network$).$ Each tuple is of the form $($trader$1,$ trader $2)$ where trader $1$ and trader $2$ are string names of each trader.

Your function should return list of tuples in alphanumeric order of trader name, where each tuple is of the form $($trader$,$ direct$\_$connections$),$ and direct$\_$connections is an alphanumerically sorted list of that trader's direct connections $($i$.$e$.$ there exists an edge between them in the trader social network$).$

You may assume:

Inputs are correctly formatted data structures and types. Just like Q$1$a$,$ you don't need to guard against something like $[(\text{'}$T$1\text{'},\text{'}$T$2\text{'}),(\text{'}$T$2\text{'},\text{'}$T$1\text{'})]$ or duplicate entries.

The pictured example:

$)$ create$\_$social$\_$network$($traders$)$

$[(\text{'}$T$1\text{'},[\text{'}$T$2\text{'},\text{'}$T$3\text{'}]),(\text{'}$T$2\text{'},[\text{'}$T$1\text{'},\text{'}$T$5\text{'}]),(\text{'}$T$3\text{'},[\text{'}$T$1\text{'},\text{'}$T$5\text{'},\text{'}$T$6\text{'}]),(\text{'}$T$5\text{'},[\text{'}$T$2\text{'},\text{'}$T$3\text{'}]),(\text{'}$T$6\text{'},[\text{'}$T$3\text{'}])]$

Another example $($not pictured$)$:

$$ create$\_$social$\_$network$($traders$)$