Overview The purpose of this assignment is to gain some practice with the basics of the Prolog programming language, and the SWI-Prolog interpreter. Specification For this assignment, you are to represent the weighted digraph, G, given below. As part of your representation, include definitions for the following relations: cost/3 - atoms of the form cost(X,Y,N) are to be read as: "there exists a path in G from X to Y with a cost of N." has_path/2 - atoms of the form has_path(X,Y) are to be read as: "graph G has a path from X to Y." cyclic- the atom cyclic is to be read as there exists a cycle in the graph G. D 10 B 10 10 3 5 C 4 9 M L 10 Submission Notes For this assignment you are to submit your representation in a zip file which contains a single Prolog source program named digraph01.pl. Overview The purpose of this assignment is to gain some practice with the basics of the Prolog programming language, and the SWI-Prolog interpreter. Specification For this assignment, you are to represent the weighted digraph, G, given below. As part of your representation, include definitions for the following relations: cost/3 - atoms of the form cost(X,Y,N) are to be read as: "there exists a path in G from X to Y with a cost of N." has_path/2 - atoms of the form has_path(X,Y) are to be read as: "graph G has a path from X to Y." cyclic- the atom cyclic is to be read as there exists a cycle in the graph G. D 10 B 10 10 3 5 C 4 9 M L 10 Submission Notes For this assignment you are to submit your representation in a zip file which contains a single Prolog source program named digraph01.pl