Exercise 3.7 Suppose that, rather than finding an optimal path from the start to a goal, we wanted a path with a cost not more than, say, 10% greater than the leastcost path. Suggest an alternative to an iterative-deepening A∗ search that would guarantee this outcome. Why might this be advantageous to iterative-deepening A∗ search?