i want all cited graph, Please do not give previous answers because they are wrong

I want in the ( e )clause the forward chain of( b).

Consider the following vector graph representing citations between publications. In information science and bibliometrics, a citation graph is a directed graph that describes citations within a set of documents. Each vertex (or node) in the graph represents a document in the set, and each edge (arc) is directed from one document to another cited.

1) Considering nodes (document names) as constants, represent the facts in the given citation graph in Prolog. ( all fact).

2) Represent the following scenario in your Prolog program:

a. Two documents are connected if there is a directed path from the first document

to the second document in the directed acyclic graph. Is there any specific property that you need to use to define this sentence in your program? What is it? Explain it briefly.

( connected(X, Y) :- edge(X, Y).

connected(X, Y) :- edge(X, Z), connected(Z, Y).)

b.)Query the SWI-Prolog to show whether document a and document g are connected.

c.) Query the SWI-Prolog to show whether document b and document h are connected.

d.)Receive the first and the second documents to check the existence of a path between them from the user's keyboard. The output is as follows:

e. )Using forward chain reasoning, properly explain the answer of (b) ( Please I want to solve this paragraph correctly)