In this programming assignment, you will implement the Extended Euclid's algorithm, a method that not only determines the greatest common divisor $($GCD$)\text{'}$d$\text{'}$ of two positive integers, $\text{'}m\text{'}$ and $\text{'}n\text{'},$ but also finds integers $\text{'}x\text{'}$ and $\text{'}y\text{'}$ such that $\text{'}mx+ny=d\text{'}.$ The objective is to create a command$-$line program that takes two positive integer arguments $(\text{'}m\text{'}$ and $\text{'}n\text{'}),$ calculates their GCD $\text{'}$d$\text{'},$ and displays the result in the format: ${?}^{\text{'}}{m}^{**}x+n^{**}y=d\text{'}.$

$**$ Instructions for Part $1$:$**$

Create a command$-$line program.

Accept two positive integers $(\text{'}m\text{'}$ and $\text{'}n\text{'})$ as command$-$line arguments.

Calculate GCD $\text{'}d\text{'}$ along with integers $\text{'}x\text{'}$ and $\text{'}y\text{'}.$

Display the result in the format: ${?}^{\text{'}}m**x+n**y=d\text{'}.$

$./$extended$\_$euclid $2418$

$24**(-1)+18**2=6$