$($i$)$ Write down the adjacency matrix and the edgelist.

$($ii$)$ Draw the degree distribution by hand.

$($iii$)$ Calculate the diameter, density and clustering coefficient per node and its average over the network.

$($iv$)*$ Find the number of $\backslash (\backslash$mathrm$\{$d$\}=3\backslash )$ paths between $2$ and $3.$ Which node pair has the most $\backslash (\backslash$mathrm$\{$d$\}=3\backslash )$ paths?