7. Consider the followin Algorithm(n: positiwe for k:=1 to n-1 tor t1 ton-k it ddui then ntancdhanug & print(k.I.dd. (a) (3 points) Assume that this algonithm reccivesa input sequence 6 and the corresponding temeives as inpat the saainput the integer n= Fill out the table below: 計計計 2 3 4 5 27 |22 00 22 1 31 ds (b) [I point] Assume that the algorithm receives the same input values as in part a). Once the
PayPal Gateway not configured
PayPal Gateway not configured