use(prolog)

pleas i want code path for this question..

cites(doc_a,doc_b)

cites(doc_a,doc_c)

cites(doc_b,doc_d)

cites(doc_b,doc_e)

cites(doc_e,doc_g)

cites(doc_c,doc_f)

cites(doc_g,doc_d)

cites(doc_f,doc_g)

cites(doc_h,doc_g)

connect(X,Y):-cites(X,Y). connect(X,Y):-cites(X,Z),connect(Z,Y).

Q).Find a list of documents that are cited by document a (using the findall built-in predicate).

a. If two documents are connected, we need the program to show the path from the first to the last node as a list. For example, the path from document a to document g are [doc_a, doc_b, doc_e, doc_g] and [doc_a, doc_c, doc_f doc_g]. If the two nodes are not connected, we should get false as an answer from SWI- Prolog. One way to represent this is by introducing a new three-arguments predicate where the first will match the initial node, the second will match the final node, and the third will match a list consisting of the nodes in a path. Query to SWI-Prolog to show the path between different pairs of nodes as shown in the figure below.

Please do not copy a previous answer.

I want a correct answer and a picture of the code, in detail