How to calculate multiplicative inverse using reverse extended GCD algorithm

I followed How to calculate the inverse key matrix in Hill Cipher algorithm? for the answer but couldn't get how to calculate 'x' in the开发者_Python百科 problem given in the post using extended GCD algorithm

have a look at this
(the question there is about RSA, but what you are looking for is the extended euclidean algorithm - EEA)