Struggling with creating the two prolog path rules, path(x,y) and also path(x,y,z)

Can some help me please I've looked on chegg already and the solutions don't seem to work.

Thanks

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 ancestor(X,Y):-% X is an ancestor of Y child(X,Y) :-% Y is parent ofX 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):-% 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. */