Please answer question with matlab code for computer algebra.

6.6.5. / 2 For each method, find the leading term in the local truncation error using (6.6.5). (Computer algebra is recommended.) (a) AM3, (b) AB3, (c) BD4. formula and see what is left over, dividing by h to account for the order difference between local and global errors. Thus the local truncation error of a k-step multistep formula is defined as Ti+1(h) ti+1) QR-1(t:) ... - dolti-k+1) h - [bxf(ti+1, lti+1)) + ... + bof(ti-k+1, (ti-k+1))]. (6.6.5) The order of accuracy of the method is the leading (lowest) exponent of h in the series expansion of Ti+1(h) around h = 0. Although we shall not present the analysis, the conclusion for the multistep methods in this section is the same as for one-step methods: the order of accuracy in the global error is the same as for the local truncation error. 6.6.5. / 2 For each method, find the leading term in the local truncation error using (6.6.5). (Computer algebra is recommended.) (a) AM3, (b) AB3, (c) BD4. formula and see what is left over, dividing by h to account for the order difference between local and global errors. Thus the local truncation error of a k-step multistep formula is defined as Ti+1(h) ti+1) QR-1(t:) ... - dolti-k+1) h - [bxf(ti+1, lti+1)) + ... + bof(ti-k+1, (ti-k+1))]. (6.6.5) The order of accuracy of the method is the leading (lowest) exponent of h in the series expansion of Ti+1(h) around h = 0. Although we shall not present the analysis, the conclusion for the multistep methods in this section is the same as for one-step methods: the order of accuracy in the global error is the same as for the local truncation error