Propose a recursive algorithm for a modification of depth-first search that imposes a limit d on the depth of the search. In other words, the algorithm always backtracks when its current path from the starting state has d edges. How would you achieve this by modifying the non-recursive algorithm in Figure 2.2?