Write the question in Python.

The purpose of this assignment is to assess your ability to: - Analyze a computing problem and to apply principles of computing and number theory to develop solutions. - Demonstrate an application of the Euclidean algorithm. - Solve a linear Diophantine equation. In this assignment, you will build a program that extends Lab Question 6. In Lab Question 6, you generated pairs of integers, a and b, and computed the gcd(a,b). If the gcd(a,b)=1, we say a and b are relatively prime. For any two relatively prime integers, there exist integers x and y such that ax+by=1. This is called an example of a Linear Diophantine equation. Write a program that finds this x and y for each relatively prime pair. A sample run is shown here