5. [20 points)Compute 5' mod 96. Show your detail work! Hints: compute the multiplicative inverse (h)e(m) of (gle(n) That is, (glp(n) [h]p(n) = (1)pn): Using extended Euclid's Algorithm, compute the multiplicative inverse of b mod a. Compute GCD(a, b) using Euclid Algorithm. For each step of the computation, you can express in terms of (a =q* b + r), where r=a mod b Let Z be integers. Find the GCD(a, b) = d = min{i*a +j*b[i,je Z and i*a+j*b> 0)