Question - Whats the largest dimension you can solve using DFS at p= 0.5 in less than a minute? Whats the largest dimension you can solve using BFS at p= 0.5 in less than a minute? Whats the largest dimension you can solve using A^* at p= 0.5 in less than a minute?

Please code in python language and explain!

Generating Environments: In order to properly compare pathing algorithms, they need to be run multiple times over a variety of environments. A map will be a square grid of cells / locations, where each cell is either empty or occupied. An agent wishes to travel from the upper left corner to the lower right corner, along the shortest path possible. The agent can only move from empty cells to neighboring empty cells in the up/down direction, or left/right - each cell has potentially four neighbors. Figure 1: Successful and Unsuccessful Maze Environments. Maps may be generated in the following way: for a given dimension dim construct a dim x dim array; given a probability p of a cell being occupied (0