Could someone please help me create a program on Python.
Tree and back arcs in a DFS
For a given set of digraphs, write a program that performs DFS oneach digraph starting at node 0 and prints out the total number oftree arcs and back arcs resulting from the traversal. Use ourstandard convention that when there is a choice of white or greynodes, the one with the lowest index should be chosen.
Input format: described below under the heading,“Digraph input format”.
Output format: For each input digraph, print out aline with the number of tree arcs and the number of back arcsseparated by a
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured