P2. The truncation error in a numerical algorithm is o(n) where n denotes the number of iterations. It is found that after 3 iterations the truncation error is 2.5%, what is the truncation error expected to be after 4, 5 and 6 iterations? Note: Having a truncation error of order o(n) implies that the error reduces as the 4th power of number of iterations i.e. le- Cn where C is a constant