As much explanation your able to provide will help **Sources, Sinks, Paths, and Cycles**Consider the following graph:### Graph ExplanationThe graph consists of 9 nodes labeled from 'a' to 'k'. The nodes are connected with directed edges as follows:- Node 'g' has edges going to nodes 'd' and 'h'.- Node 'h' has an edge going to node 'e'.- Node 'k' has an edge going to node 'f'.- Node 'd' has an edge going to node 'a'.- Node 'e' has edges going to nodes 'f' and 'b'.- Node 'f' has an edge going to node 'c'.- Node 'a' has an edge going to node 'b'.- Node 'b' has an edge going to node 'c'.### Questions1. **Which nodes are sources?** (Enter list with only one space between nodes.)2. **Which nodes are sinks?** (Enter list with only one space between nodes.)3. **What is the length of the shortest path on this graph?**4. **What is the length of the longest path on this graph?**5. **Does this graph contain any cycles?** (Enter yes or no)

The graph given to us is as follows: We are asked to find the nodes which are the sources of the graph. A vertex x is said to be a source of a directed graph if there are no incoming edges to the vertex. From the graph, we see that the only node which is a source is the vertex d.Now we need to find the nodes which are sinks of the graph. A vertex y is said to be the sink of a directed graph if there are no outgoing edges. From the graph, we see that the only node which is a sink is the vertex c. Now we are asked to find the length of the shortest path on the graph. We need to find the shortest path from a source vertex to a sink vertex. We need to find the shortest path from vertex d to vertex c. There are three shortest paths from vertex d to vertex c are as follows: d→e→f→cd→e→b→cd→a→b→c The length of three mentioned shortest path from vertex d to vertex c is three.We are asked to find the length of the longest path on the graph. We need to find the longest path from the source vertex d to the sink vertex c. The longest path from vertex d to vertex c are as follows: d→g→h→k→f→c: Length-5d→g→e→h→k→f→c: Length-6 Therefore, the length of the longest path of the graph is 6. We can see that there are no cycles in the given graph.