Please answer with steps and figures

The adjacency matrix is a useful graph representation for many analytical calculations. However, when we need to store a network in a computer, we can save computer memory by offering the list of links in a Lx2 matrix, whose rows contain the starting and end point i and j of each link. - The corresponding adjacency matrices. - The corresponding link lists. - The average clustering coefficient of the network - What kind of information can you not infer from the link list representation of the network that you can infer from the adjacency matrix? - How many paths (with possible repetition of nodes and links) of length 3 exist starting from node 1 and ending at node 3