Use the Grassfire algorithm and find all the shortest paths that the robot could take to go from the START node (Green) to the GOAL node (Red).

(Hint : for example use the given below 2D grid to answer the above question it should give something like this

4x START \begin{tabular}{|c|c|c|c|c|c|} \hline 9 & & 9 & 8 & & \\ \hline 8 & 9 & 8 & 7 & 6 & \\ \hline 7 & & & 6 & 5 & 4 \\ \hline 6 & 5 & & & & 3 \\ \hline 5 & 4 & & 2 & 1 & 2 \\ \hline & 3 & 2 & 1 & 0 & 1 \\ \hline & & 3 & 2 & 1 & 2 \\ \hline \end{tabular}