write some functions on python 2.7 ASAP!

all functions should be coded in a single file [login to view URL] all should be executed with snap API. 1. Given the vertex pairs associated to the edges of the undirected graph in Pre Processing, find the degree of each vertex. Output: In descending order, print the first 10 elements of the degree sequence. 2. In graph theory and network analysis, indicators of centrality identify the most important vertices within a graph. Use the graph from Pre Processing to SNAP API to calculate the following centrality measures for each vertex: a) Page Rank, b) Degree Centrality, c) Closeness Centrality Output: For all three measures, print the measure and the 5 most important vertices identified for that measure in a table format. [login to view URL] a function “generateGraphFromPairs” that takes as input a list of vertex pairs (i.e. (u,v)) associated to the edges of a graph, construct an adjacency matrix for the graph. Output: print the adjacency matrix and its values in row/column format. 4. Define a function “listEdgesAdjMatrix” that takes as input an adjacency matrix(row/column format) of a graph and give the number of times each edge appears. Output: print the vertex pair (u,v) and number of occurrences in a table format. 5. Given a list of edges of a simple graph determine whether it is connected and find the number of connected components if it is not connected. Output: If the graph is connected print 1, otherwise print the number of connected components. 6. Define a function “isEulerCircuit” that takes as input the vertex pairs associated to the edges of a multigraph, determine whether the graph has an Euler circuit and, if not whether it has an Euler path. Output: Print in order the vertex pairs that construct the Euler path or circuit if it exists. 7. Define a function “dijkstraAlgorithm” that takes in as input a list of edges and weights of these edges of a weighted connected simple graph and two vertices in this graph, find the length of a shortest path between them using Dijkstra’s algorithm. Also, find the shortest path. Output: Print the length of the shortest path. Print the vertex pairs for the edges that construct the shortest path.