Please give an algorithm that uses dynamic programming approach to solve this problem which finds the minimum number of cuts to seperate R $($raisins$)$ from a chocolate. Input is a $2$d array and R $($raisins$)$ are represented as $1$