Cryptography (ECE5432/ECE5632/CSE4631)

You are required to write a Python script that takes two positive integers (r0, r1) as input and calculates gcd(r0, r1) according to the Euclidean Algorithm as follows

Then test it using the following test cases:

gcd(12345, 6789)

gcd(0, 123)

gcd(110011102454, 323125425145)

Deliverables:

• One Python script.
• One PDF with Screenshot(s) of the three test cases provided