There is a chocolate bar consisting of an n $\backslash$times m rectangular grid of squares. some of the squares have raisins in them, and you hate raisins. you would like to break the chocolate bar into pieces so as to separate all the squares with raisins, from all the squares with no raisins. at any time a break separates a piece into two new pieces along a row or a column.

Below are $2$ example chocolate bars, and possible steps to break them up$.$

Design and implement a Brute Force algorithm to find the smallest number of breaks needed for the task. Next, modify your algorithm to use dynamic programming to accomplish the task. RaisingsExample $1($R$)$ in $2$d array are represented by $1$