The following iterative sequence is defined for the set of positive integers: sn/7 if n is a multiple of 7 un = n-1 otherwise Using the rule above and starting with 13, we generate the following sequence: 13 U13 = 12 + U12 = 11 U11 = 10 + U10 = 9 Ug = 8 + Ug = 7 U7= 1. It can be seen that this sequence (starting at 13 and finishing at 1) contains 8 terms. The below function takes as input an integer n and returns the number of terms generated by the sequence starting at n. function i-Seq(n) u=n; i=1; while u~=1 if statement 1 uTu/7; else statement 2 end i=i+1; end statement 1 and statement 2 should be replaced by: Statement 1 is "mod(u,7)==0" and statement 2 is "u=u-1;" Statement 1 is "n%7==0" and statement 2 is "u=u-1;" Statement 1 is "mod(u,7)==0" and statement 2 is "u=n-1;" None of the choices The following iterative sequence is defined for the set of positive integers: sn/7 if n is a multiple of 7 un = n-1 otherwise Using the rule above and starting with 13, we generate the following sequence: 13 U13 = 12 + U12 = 11 U11 = 10 + U10 = 9 Ug = 8 + Ug = 7 U7= 1. It can be seen that this sequence (starting at 13 and finishing at 1) contains 8 terms. The below function takes as input an integer n and returns the number of terms generated by the sequence starting at n. function i-Seq(n) u=n; i=1; while u~=1 if statement 1 uTu/7; else statement 2 end i=i+1; end statement 1 and statement 2 should be replaced by: Statement 1 is "mod(u,7)==0" and statement 2 is "u=u-1;" Statement 1 is "n%7==0" and statement 2 is "u=u-1;" Statement 1 is "mod(u,7)==0" and statement 2 is "u=n-1;" None of the choices