Discrete mathematics for computing

show all work

10 un equcnc 01 PS dll dlgur ! 10 Consider the following sequence of steps: 1. Input a positive integer n 2. answern 3. While n> 1 do 3.1.nen-1 3.2. answer + answer xn 4. Output answer (a) Construct a trace table to show what happens when 4 is input. (0) Is this sequence of steps an algorithm? Give a reason for your answer. 11 Writo 1