C. Apply the cell decomposition algorithm in the figure below. After finding the cells, construct the corresponding adjacency graph, and run Dijkstra's algorithm one the graph to find the shortest path from the bottom-left cell to the top-right cell. Write down (in order) which cells are expanded by Dijkstra. 10 8 6 5 4 3 2 0 1 2 3 45 6 7 89 10 11 C. Apply the cell decomposition algorithm in the figure below. After finding the cells, construct the corresponding adjacency graph, and run Dijkstra's algorithm one the graph to find the shortest path from the bottom-left cell to the top-right cell. Write down (in order) which cells are expanded by Dijkstra. 10 8 6 5 4 3 2 0 1 2 3 45 6 7 89 10 11