Let x and n be integers greater than 1. consider the following algorithm. t0, s0 for e{1, 2, x? do r for je (1, 2, , n) do // line a the and l symbols and the indentation are important: they tell you which lines are inside which loop. so, for example, line a is inside the i-loop, but outside the j-loop. (a) itx 4 and n 5 initially, what is the value of s after this segment executes? (b) count the number of additions this segment performs. your answer should be in terms of x and n.