Your job is to develop a routing path planning sequence for the robot starting

in the home dome must visit the grain dome $($dome $7)$ to retrieve grain and deliver the grain from dome

$7$ to the processing dome $($dome $4).$ You may assume the distance required to traverse the distance

inside the dome is not necessary in the path routing. Assume that vehicle is left biased as necessary.

$($Choose two of the following three Questions $-1$A$,1$B$,1$C$.$ If you choose to do the third question, it

will be counted as extra credit on the exam. You must do at least two of the three, and question $1$D

for full credit.$)$

A$)(10$ pts$)$ Use a breadth first path planning algorithm to determine the list and sequence of steps

necessary to find the best path. Be sure to fully describe the process. Using Breath First, what is

the final path?

B$)(10$ pts$)$ Use a depth first path planning algorithm to determine the list and sequence of steps

necessary to find the best path. Be sure to fully describe the process. Using Breath First, what is

the final path?

C$)(10$ pts$)$ Use the A$*$ Use a breadth first path planning algorithm to determine the list and

sequence of steps necessary to find the best path. Be sure to fully describe the process. Using

Breath First, what is the final path?

$($You must answer question D$)$

D$)(10$ pts$)$ Which of the algorithm$($s$)$ is a Greedy Routing Algorithm? Discuss what is a greedy

routing, and the results of using such an algorithm that is considered greedy. Suppose there is a

tunnel failure, discuss an approach that allows the robot to dynamically adjust its path as the

information is updated to it$.$ How does this dynamic approach compare with other approaches

you selected?