Consider the simple directed graph shown below, with no cycles.

Use a relation to represent the connectivity of the nodes in Prolog. Use rules and recursion to define a predicate path(x, y), showing whether there is a path between node x and node y. Use the program to check for a path from A to E. What about the path from B to C? What does the query path(a, X) return? What if the graph had cycles (say by adding an arc from d to a)? Explain.

E