Please do this in python(same format as pseudocode) Implement the Euclidean algorithm to find the greatest common divisor of any two positive integers. It should implement the pseudocode provided in the text. It should allow the user to enter two integers. Your program should output the intermediate values of q, r1, r2 for each step and should return the greatest common divisor

Python please I need help with this problem from zybooks

In python language please Input a sentence from the user and compute the following: Eg: Dont give up Find the ASCII value for each character of each word and calculate the sum. //hint use ord() & chr() function are used to find corresponding ASCII & char values in python. //*if you get any value ranges from 1 to 32 then replace with $ symbol //char[1-32]--->S Dont give up ASCII(D)=68 ASCII (0)=111 ASCII(n)=110 ASCII(t)=116 sum=68+111+110+116=405. The set are (40, 04), (45,54), (05,50). The biggest values in a set is(40, 54, 50). char(40)=( char(54)=6 char(50)=2 ASCII(g)=103 ASCII()=105 ASCII(v)=118 ASCII(e)=101 sum=103+105+118+101-427, The set are(42.24), (47,74),(27,72), The biggest values in a set is (42.74,72) char(42)=* char(74)=) char(72)=H ASCII(u)=117 ASCII (p)=112 sum=117+112=229, The set are (22.22). (29.92). (29.92), The biggest values in a set is(22.92.92) char(22)=$(Replaced with S)

The area A of a Hemisphere is computed using the following equation. A = 4Tr2 %3D where n=3.14159265 and r is the radius. Write an algorithm (Step 4 of problem solving methodology) that reads a radius r from a user then computes the area A using the above-mentioned formula. The algorithm repeats the same process for five positive radius values. [Hint: use any repetition structure]

Use a while loop function instead of a for loop sing python