Let us have a chess board n $\backslash$times n$,$ and some positions are walls. Find the maximumnumber of towers which can be on chessboard, such that none of them is able to capture any other.Thus, a solution requires that no two towers share the same row or column which is not a wall.Design an efficient algorithm which finds some solution.Design an algorithm if towers are separated by the wall.$($Hint: use Hall's Theorem$)$