I want answers, no explanation, I want to crosscheck my answers.

$1.$ Given the friendship graph below, calculate and plot the degree distribuFon of the graph.

Be sure to label the plot axes.

$2.$ Draw the graph specified in the adjacency matrix below. Is this graph connected? If yes, is it weakly connected or strongly connected? Note that aij is the weight of the edge from vi to vj

$040000$

$002000$

$000002$

$703000$

$000200$

$000010$

$3.$ Use Dijkstra$$s or Prim$$s Algorithm to create a shortest path table for the friend graph from problem $1.$ What is the diameter of this graph? Show a minimum spanning tree of this graph as an adjacency matrix.

$4.$ Given the following flow network from v$0($source$)$ to v$7($sink$),$ use the Ford$-$Fulkerson algorithm to determine the maximum flow. Provide the resulFng flow, and draw and label the flow network and residual network.

Edge list:

$\{($v$0,$v$1,1),($v$0,$v$2,3),($v$0,$v$3,3),($v$1,$v$6,4),($v$2,$v$1,2),($v$2,$v$5,1),($v$3,$v$2,3),($v$3,$v$4,2),($v$4,$v$7,4),($v$5,$v$1,5),($v$5,$v$4,3),($v$5,$v$7,3),($v$6,$v$2,3),($v$6,$v$5,2),($v$6,$v$7,3)\}$

$5.$ For the friendship graph in problem $1,$ calculate the degree centrality, betweenness centrality and closeness centrality for each node. Provide a table showing the rank of each node for each measure.

$6.$ For the friendship graph in problem $1,$ what is the clustering coefficient?

$7.$ For the friendship graph in problem $1,$ assume that Cindy is a foe of Nicholas and Priyanka, Tushar is a foe of Wusheng and Komal and all the other edges in the graph represent friendship. According to social balance theory, is this new friend$/$foe graph balanced?

$8.$ Calculate PageRank values for the graph below when

$$ a$=1,$ b$=0$

$$ a$=$b$=0\mathrm{.}3$

$$ a$=0\mathrm{.}85,$ b$=1$

$$ a$=0,$ b$=1$

Discuss the effects of different values of a and b for this particular problem.

$9.$ You have been tasked to design a classifier that decides whether students will be admitted to a CS graduate program. ApplicaFons to the program are received from students all around the world. ApplicaFons contain student name, address, mobile phone number, final grade point average in undergraduate program and transcript. Describe what information from the applicaFon you would use as input to your classifier. For each piece of information, what $($if anything$)$ would need to be done to clean or transform the information into input data. For each of the transformed data input, identify the type $($nominal$,$ ordinal, interval or ratio$).$ Give at least $3$ other pieces of information that would be helpful and describe why you think they would help.

$10.$ You are given the following set of data

Name, City, Likes Beyonc$,$ In a relationship, Age, Number of concerts per year, Bought ticket to see Taylor Swift

Kate Chicago Yes No $238$ Yes

Joe New York No No $364$ Yes

Mena New York Yes Yes $4320$ No

Pat Chicago No Yes $192$ No

Tim Chicago Yes No $2014$ Yes

Tina Chicago Yes Yes $547$ Yes

Using entropy as a measure of purity, design a decision tree to predict whether someone bought a ticket to see Taylor Swift or not. Show how each decision node was selected.