Using the extended Euclidean algorithm, find an integer xxx where 0≤x<260 \le x < 260≤x<26 such that 7x≡1(mod26)7x \equiv 1 \pmod{26}7x≡1(mod26).
x=11x = 11x=11
x=15x = 15x=15
x=19x = 19x=19
x=23x = 23x=23