I have created the node and edge facts, please help me with question 2, thank you.

1) Write all possible node and edge facts that describes the structure of this graph G as examples below: node(a). % "a is a node of this graph. edge(a,b). % There is an edge (directed) from node "a" to "b". 2) Complete the definition for all these rules. parent(X,Y) :-% There is a directed edge from X to Y. child(X,Y) :-% Y is parent of X. path(X,Y) :-% find a directed path from node X to node Y. path(X,Y,Z):-% find a directed path from node X to Y and store in Z. length of path(X,Y, Z):-% Z is Length of a path (directed) from X to Y. connected(X,Y):-% There is a directed path from X to Y, or from Y to X undirected edge(X,Y) :-/* There is an edge (ignoring the directions) from X to Y or from Y to X*/ undirected path(X,Y):- /* find a path (ignoring the directions) from node X to node Y.* Important Note: There are circles in this graph including nodes some nodes such as: e, f, g. You should find a way to avoid infinite recursion by making sure that you visit each node along your paths once