Write the following code in python and be sure to use turtle module (import turtle).

Only write Depth First Search(DFS) for this question.

Perform a DepthFirst Traversal for any graph

a. The Depth First Traversal Algorithm should take the graph as input and produce the order of the nodes traversed

b. At each time step the GUI should highlight the edges through which the DFSprogresses on the screen

KINDLY DO WHAT I ASKED I WILL GIVE THE UPVOTE.