i need proper solution in detail

Given a graph G=(V,E,W), where V is the set of nodes in G,E is the set of edges in G, and W is the set of positive weights assigned to edges in G. For a pair of nodes u and v, consider two graph-based similarity measures: (1) Sim1 (Jaccard similarity): Sim1(u,v)=NuNvNuNv, where Nu and Nv are the set of neighbors of u and v respectively, and denotes the number of neighbors (cardinality of the set). (2) Sim2:Sim2(u,v)=ex, where x is the length of the shortest path between u and v, in terms of the total weights of the edges in the path. We can find the shortest path between any two nodes with a complexity of O(Vlog(V)+E). Mention one advantage and one disadvantage of both the measures when used to compute the similarity between two nodes