Chocolate bar consists ofnsquares arranged in a rectanglar pattern. as usual, the bar can be broken along the lines between the squares. we aim to split the barintonsmall squares (always breaking along the lines between the squares) with aminimum number of breaks. proof with the of the principle of mathematicalinduction that we have to break the bar (at least)n−1 times