You are given a map of a city represented as a 2D grid, where some cells are blocked, some are open, and some contain different types of terrain that affect the cost of traversing them. You need to find the shortest path between two points on the map while avoiding blocked cells and taking into account the terrain cost. How would you approach this problem?a)Dijkstra's Algorithmb)Breadth-First Searchc)A* Search Algorithmd)Depth-First Search

The shortest path problem can be solved using:A. Depth-first searchB. Breadth-first searchC. Dijkstra's algorithmD. Floyd-Warshall algorithm

The following one is the examples of optimization problems.Finding the shortest distance from an originating city to a set of destination cities, given the distances between the pairs of cities.What type of approach is this in problem solvingGreedy ApproachDivide and Conquer ApproachBrute Force approachBacktracking algorithmic

You are given a state graph with link costs. The running time of the algorithm should be a function of the number of states in the graph and the algorithm should guarantee that the path with shortest path cost is found.            Choose the most efficient search method that meets the criteria indicated above.

The shortest path in a graph with weighted edges can be found using:A. Depth-first searchB. Breadth-first searchC. Dijkstra's algorithmD. Kruskal's algorithm

find the number of paths that you could take to travel from A and B if you are only allowed to move to the right or down through the grid. You cannot travel a path if the path is not drawn in .