The first function takes inputs $a$ and $b$ and returns $[q,r]$ such that $a = bq + r$. This is performing a modulus operation such that $0\leq{r}<b$.

Examples:
[2, 5] [2, 5] 
[5, 3] [5, 3] 
The second function will take the same inputs $a$ and $b$ and this time return a triple $[x,y,d]$ such that the equation $ax + by = d$ is satisfied. The results $x$ and $y$ will be integers as a result of the equality gcd($a$,$b$) = gcd($b$,$r$) where r is the remainder determined from my_div($a$,$b$).

A few examples of output:
66*12345 + 1495*545 = 5 [66, 1495, 5] 66*12345 + 1495*545 = 5 [66, 1495, 5] 
48*34564 + 4795*346 = 2 [48, 4795, 2] 48*34564 + 4795*346 = 2 [48, 4795, 2] 
