Basically I am trying to understand the concept of dynamic programming via Rod Cutting example.
How the number of ways in which a rod of length $n$ units can be cut is ${2}^{n-1}$ and not $2^n$?
Consider the smallest cut be of one unit and there can also be a case where there is no cut at all .