*P1_Graphs' is a list containing 5 networkx graphs. Each of these graphs were generated by one of three possible algorithms: * Preferential Attachment ("PA") * Small World with low probability of rewiring (SW_L") * Small World with high probability of rewiring (''SW_H") Anaylze each of the 5 graphs using any methodology and determine which of the three algorithms generated each graph. The graph identification function should return a list of length 5 where each element in the list is either 'PA', 'SW_L', or 'SW_H'. ]: def graph_identification (): # Your Code Here return ans# Your Answer Here graph_identification () ]: ans_one = graph identification () assert type (ans_one) == list, "You must return a list" Assignment 4 ]: import networkx as nx import pandas as pd import numpy as np import pickle Part 1 - Random Graph Identification For the first part of this assignment you will analyze randomly generated graphs and determine which algorithm created them. ]: G1 = nx.read_gpickle("assets/A4_P1_G1") G2 = nx.read_gpickle("assets/A4_P1_G2") G3 = nx.read_gpickle ("assets/A4_P1_G3") G4 = nx.read_gpickle("assets/A4_P1_G4") G5 = nx.read_gpickle ("assets/A4_P1_G5") P1_Graphs [G1, G2, G3, G4, G5] = *P1_Graphs' is a list containing 5 networkx graphs. Each of these graphs were generated by one of three possible algorithms: * Preferential Attachment ("PA") * Small World with low probability of rewiring (SW_L") * Small World with high probability of rewiring ("'SW_H") Anaylze each of the 5 graphs using any methodology and determine which of the three algorithms generated each graph. The graph identification function should return a list of length 5 where each element in the list is either 'PA', 'SW_L', or 'SW_H'.