(a) Consider the Prolog database given below [12] p(1,3,5) p(2,4,1) p(3,5,2) p(4,3,1) p(5,2,4) What do the queries given below return? ?- bagof (z,p(X,Y,Z) Bag) . ? findall(z,p(X,Y,Z), Bag) . ?- setof (Z,XYp(X,Y,Z), Bag) (6) (b) Consider the following graph that indicates the cost of all the individual arcs as well as an estimate of the cost for the remaining path between each node and the goal (indicated by the number above the node) The node a is the initial node and is the goal Indicate the next node that is chosen from each node in the path from the initial node to the goal by the best-first orithm (6) Clearly state on what grounds each next node is chosen 3 2 3 b 4 4 3 5 e d 3 (a) Consider the Prolog database given below [12] p(1,3,5) p(2,4,1) p(3,5,2) p(4,3,1) p(5,2,4) What do the queries given below return? ?- bagof (z,p(X,Y,Z) Bag) . ? findall(z,p(X,Y,Z), Bag) . ?- setof (Z,XYp(X,Y,Z), Bag) (6) (b) Consider the following graph that indicates the cost of all the individual arcs as well as an estimate of the cost for the remaining path between each node and the goal (indicated by the number above the node) The node a is the initial node and is the goal Indicate the next node that is chosen from each node in the path from the initial node to the goal by the best-first orithm (6) Clearly state on what grounds each next node is chosen 3 2 3 b 4 4 3 5 e d 3