Question

shortest distance can be determined by which algorithm 
a) dynamic programming 
b) greedy method 
c) backtracking 
d) divide & conquer ​

Answer 1

Answer:

c

Explanation:

because there is one .....

Answer 2

Answer:

C shortest distance can be determined by backtracking algorithm.

Hope its help you!!

PLEASE MARK ME AS BRAINLIEST.

FOLLOW ME ♥️♥️♥️♥️