Problem Two: Consider the following Gauss-Legendre algorithm for computing : a) Set a = 1, b = t = and x = 1. b) Repeat the following commands until the difference between a and b is within some desired accuracy, E. (i.c.la-bl SE): y = a = 1 = la-SE I bat (by EE- xy - a) 2 b = by t-t-x(y-a) x = 2x c) From the resulting values of a, b and I, an estimate of is: (a + b)2 plest 4 Write a script that implements the algorithm, which is also illustrated in the flowchart. Use the while structure, and E-le-8. pi_est = (a + by 2)(40) End