Problem 1 Consider the recursive equation Pn0.05pm-1- V1-0.052 with initial values Po = 1 and P1-, Let Pn, n > 0 denote the sequence values using standar precision and qn, n 2 0, denote the sequence computed with 3-digit chopping. Graph Pn 0 S n 100, along with the relative error comparing pn and qn over the same range. Does the chopping error build up exponentially or linearly? (You can use Matlab or Excel to complete this problem) Problem 1 Consider the recursive equation Pn0.05pm-1- V1-0.052 with initial values Po = 1 and P1-, Let Pn, n > 0 denote the sequence values using standar precision and qn, n 2 0, denote the sequence computed with 3-digit chopping. Graph Pn 0 S n 100, along with the relative error comparing pn and qn over the same range. Does the chopping error build up exponentially or linearly? (You can use Matlab or Excel to complete this problem)