Problem 1) The value of t can be calculated using the following series: 1.1 1. 1 35 79 1 T = 4 (1 ·) = 4>(-1)"-1, + + - ... 2n – 1 n=1 Develop an algorithm that performs the following (you can present...

Extracted text: Problem 1) The value of t can be calculated using the following series: 1.1 1. 1 35 79 1 T = 4 (1 ·) = 4>(-1)"-1, + + - ... 2n – 1 n=1 Develop an algorithm that performs the following (you can present it in the form of a pseudo-code or a list of steps): Determine using the above equation. If a, is the nth term of the series, then sum S, of the first n terms is Sn = Sn-1+an. In each pass, calculate the estimated error E given by E = Sn-Sn=1. Stop adding terms when E < 10-6="" and="" report="" the="" approximate="" value="" of="" 7.="" sn-1="" note:="" you="" are="" not="" asked="" to="" submit="" any="" code="" for="" this="" part.="" submitting="" the="" algorithm="" is="">