In the Shortest Route Algorithm Discussed in the Textbook, Backtracking

Multiple Choice

In the shortest route algorithm discussed in the textbook, backtracking means

A) going back on your calculations and revising it
B) solving the problem again using destination as the origin and vice-versa
C) process that identifies the shortest path, starting it from the origin
D) process that identifies the shortest path starting with the destination and working backward toward the origin