Can someone solve this in a similar format using extended euclidean algorithm for the multiplicative inverse of 172 mod 661

Now to find the inverse of 17 mod 37, take a = 37 and b = 17 and use the extended Euclidean algorithm. It must produce g = 1. 37 HO r S t r1 s1 ti 1 17 0 1 2 17 0 1 1 -2 3 -2 -5 11 1. 2 -5 11 1 6 -13 1. 1 -13 0 -11 24 So 1 = 6 . 37 13 17. Then 1 -13 . 17 & 37 = ( 37 13 ) 17 = 24 17 * 37 The multiplicative inverse of 17 mod 37 is 24