Parry Hotter is competing in the tri-algorithm tournament, in which he must traverse an n by n maze which is filled with traps. D[i, j] denotes the status of each location in the maze: if D[i, j] = 1, it means location (i, j) is trapped; if D[i, j] = 0, it means location (i, j) is safe. Hogrid wants to give Parry some help by indicating some safe locations in the maze. Specifically, Hogrid wants to find the largest square-sized section of the maze which has no traps. Design an efficient dynamic programming solution for this problem, and analyze the runtime.