Prolog : 1) Write all possible node and edge facts that describes the structure of this graph G as examples below.

2) Complete the definition for all these rules.

The Purpose of this question is to write a Prolog Program which describes a directed graph (G), with the following structure and allows us to ask some questions about this graplh 1) Write all possible node and edge facts that describes the structure of this graph G as examples below: node (a) edge (a,b). 8 "a" is a node of this graph. % 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): path (X,Y): 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): from node X to node Y. 8 Y is parent of X. % find a directed path from node X to node Y. /*find a path (ignoring the directions)