I want code assemble

Using SWI-Prolog & SCREENSHOT

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

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-argument 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. Note: you need to use the connected predicate that you defined in 2.a to define the path rule.

Welcome to SWI-Prolog (threaded, 64 bits, version 9.0.3) SWI-Prolog comes with ABSOLUTELY NO WARRANTY. This is free software. Please run ?- license. for legal details. For online help and background, visit https://ww. swi-prolog.org For built-in help, use ?- help(Topic). or ?- apropos(Word). ?- consult('TUsers/Huda/Dropbox/Taif University 2/Second Semester 1444/AI/practical_examples/assignment1.pl'). true. ?- path(doc_a,doc_g, X). x= [doc_a, doc_b, doc_e, doc_g] ; x= [doc_a, doc_c, doc_f, doc_g]; false. ?- path(doc_a,doc_b, X). x= [doc_a, doc_b]; false. ?- path(doc_a,doc_h,X). false. ?- path(doc_b, doc_g, X). x= [doc_b, doc_e, doc_g] ; false