In: Advanced Math
2. (16 pts) Use binary modular exponentiation to find 45 mod 84.
(Use either table approach taught in slides or the pseudocode
algorithm.)
3. (20 pts) Use the Euclidean Algorithm to find the greatest common
divisor of the integers