Multiplicative Inverse: Java code

Instructions Implement the extended Euclidean algorithm to find the multiplicative inverse in modular arithmetic. Given values b and n, the program should return the multiplicative inverse of b in Zn. Your implementation should implement the pseudocode provided in the text. It should allow the user to enter integers b and n.

Your program should

allow the user to enter a value for b and n, as integers. output the intermediate values of q, r1, r2, t, t1, and t2 for each step, and return the value of the multiplicative inverse or state that the multiplicative inverse does not exist. screenshots showing the output table and inverse for at least 4 pairs of inputs.