(a) Describe how the shared nearest neighbor algorithm groups vertices. (b) Based on your answer to part a, how many total nodes are required at minimum to find a pair of nodes with n shared nearest...

(a) Describe how the shared nearest neighbor algorithm groups vertices.

(b) Based on your answer to part a, how many total nodes are required at minimum to find a pair of nodes with n shared nearest neighbors? Explain your answer.

(c) Given the list of vertices with x and y coordinates shown below, construct an adjacency matrix of the vertices, where vertices are considered to be neighbors (adjacent) if they are within a distance of 4, using Euclidean distance. Note, the vertices should not be considered adjacent to themselves.

(d) Using the adjacency matrix that you have created, find and list all the pairs of nodes that have at least two shared neighbors in common.

(e) List all the pairs of nodes that have at least three shared neighbors in common.