Implement these three graph functions (replace word pass by the implementation)

The graph is represented as adjacency list AdjList. You may assume if the graph has n vertices, then those would be labeled 0, 1, 2, ..., n-1

Recall that unlike the code in class, in Python all the indices start from 0.

For example for the adjacency list

L = [

[1,4],

[2,0],

[1,3,4],

[2,4],

[2,3,0]

]

AreNeighbors(L, 1, 2) would be True

GetDegree(L, 0) would be 2

IsPath(L, [1, 2, 0, 1]) would be False (no edge from 2 to 0)

## you may assume the graph is undirected

## returns True if there is an edge between i and j ## returns False otherwise def AreNeighbors(AdjList, i, j): pass

## returns the degree of vertex i def GetDegree(AdjList, i): pass

## PathList is a list of vertices ## return True if it is a valid path def IsPath(AdjList, PathList): pass

In PYTHON