Python program ("Use python to solve the question")

1. Path testing (20 marks)

Write a function whose input is an adjacency matrix A of a graph G and a list L whose elements are vertices of G (possibly with repetitions). The function should return true if L is a path and false otherwise. The runtime of the function should be O(len(L)).