Define a function hasPath, which expects a directed graph and the labels of two vertices as arguments. This function returns True if there is a path between the two vertices, or returns False...

Define a function hasPath, which expects a directed graph and the labels of two vertices as arguments. This function returns True if there is a path between the two vertices, or returns False otherwise. Test this function thoroughly with the case study program.