For the given undirected graph G: (a) compute the degree and variability parameters of the graph; (b) find adjacency matrix for the graph G; (c) determine binary code(G) for the graph; (d) find...

For the given undirected graph G:

(a) compute the degree and variability parameters of the graph;

(b) find adjacency matrix for the graph G;

(c) determine binary code(G) for the graph;

(d) find closeness parameter or each node of the graph; and

(e) what is the betweeness measure for node number 2?