Need help writing Prolog codes. Details below:

Consider the following directed graph. Enter all the edges between two nodes in the graph and the length of the edge as facts using the connect predicate. (The number next to each edge shows the length of that edge). Some examples for nodes a and d are as follows: connect (a, b, 5) connect (a, d, 10) connect (d, c, 4) connect (d, e, 6) connect (d, f, 11) connect (d, g, 4) 10 Consider the following directed graph. Enter all the edges between two nodes in the graph and the length of the edge as facts using the connect predicate. (The number next to each edge shows the length of that edge). Some examples for nodes a and d are as follows: connect (a, b, 5) connect (a, d, 10) connect (d, c, 4) connect (d, e, 6) connect (d, f, 11) connect (d, g, 4) 10