Can you define the overflow conditions, when adding two 2’s complement numbers of any length n, only in terms of the carry-in and carry-out of the sign bit (i. e., bit n-1) ? explain your answer

Use a while-end loop in a script file to calculate the sum of the first n terms of the series: summation sign on the top n bottom k=1 : )^k * k^2 +5k)/3^k show the script file and the two results of n = 10 and n = 20.