Please give a complete explanation and do not copy the answer from somewhere else. Only answer if you know the concept. Thanks!

Question 2 (25 marks) For this question, you should write a short report that explains how your program works and give some execution examples. Given a graph G and two nodes A and Z in G, write a program in Prolog or Lisp that finds an acyclic path P between A and Z. The path should be represented as an ordered list of nodes from the start node to the goal node. Since the path must be acyclic, a node can appear in the path only once