We are solving a problem with: n=7, a=2, b=3, c=5
Initial state: Only dp[0] = 0, all other values are -∞ (negative infinity).
We will fill the dp table step by step where dp[i] represents the maximum number of cuts possible for a rod of length i.