You want to find a driving route that minimizes the number of turns between two locations.

(a) Would you rather employ a sampling-based or a discrete algorithm such as Dijkstra or A* for doing this and why?

(b) Provide a possible cost function that encodes both path length l and the number of turns t.