Please answer this questions:
1-Maximum square submatrix Given an m × n boolean matrix B, find its largest square submatrix whose elements are all zeros. Design a dynamic programming algorithm and indicate its time efficiency.
(The algorithm may be useful for, say, finding the largest free square area on a computer screen or for selecting a construction site.)
2-. a. Show that the time efficiency of solving the coin-row problem by straightforward application of recurrence (8.3) is exponential.
b. Show that the time efficiency of solving the coin-row problem by exhaustive search is at least exponential.