Using Python:

1) Use Ramanunjan's formula to provide an apporximation of a 1 212 (4k)!(1103 + 26390k) (k!)43964k 9801 k=0 Remark: Others series can be used to provide approximation of a For instance - 1 n=1 and 2-1 - 2n - 1 8 n=1 Provide two more functions wich compute an approximation of it by using the series of square inverse and the series of odd-square inverse. Compare the efficiency of the three methods by printing the errors for an increasing sequence of of n. (Remark you can import Decimal from decimal to obtain 50 signigicant digit in the expression of t)