Generate the code for a recursive function: closest(n: int, 1st: list)--> int The function returns the value of the element in the list that is closest in value to, but not greater than the target number n. The code should work for any list of integers with a length greater than or equal to 1. See sample test results below: Function Call: Returns: 3 closest (5, [1, 3, 6, 9, 22]) closest (15, [22, 9, 16, 3, 1]) |c1osest (5, [-5, 36, 12, 27, б, -14, 19, 27, 341) closest (5, [15, 61, 21, 12, 4, -25, 5, 51, -55]) closest (-10, [-5, -61, -21, -17, 16]) 9 -5 -17

Depth-first search (DFS) also known as Depth First traversal is an algorithm used to traverse or search the nodes in a tree or graph data structure. Traversal usually means visiting all the nodes of a graph. DFS performs in a depth-ward manner. It uses a…